Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Sukima Cloud Theory

Matsumoto, Yugo (a.k.a. Naname)

Published Dec 18, 2025• 0 citations
Publisher

Abstract

I’m posting Sukima Cloud Theory here. This paper presents a structural model in which existence, observation, and communication are treated as a single equilibrium process based on pressure dynamics. Shared for readers interested in non-temporal, non-interfering structural theories. Related updates may be available at: patreon.com/NMStructuralTheoryLab

DOI
10.5281/zenodo.17975494

Related papers

Dynamic Probability Space Theory

Yugo Matsumoto

I’ve shared updated versions of my work on Dynamic Probability Space Theory (DPS). These papers develop a framework in which probability itself is treated as a fundamental structural principle of existence, formalized through the Existence Field Equation and dynamic probability flow. Versions 1.2 and 1.3 are presented here as independent preprints, reflecting an ongoing theoretical exploration of reality, observation, and cognition. Related updates may be available at: patreon.com/NMStructuralTheoryLab

•Dec 20, 2025•0 citations

Total State–Space Coexistence Theory: A Structural Framework for Time, Probability, and Experience

Hemant Kumar Kushwaha

•Jan 1, 2026•0 citations

Hierarchical Condensation: A Unified Framework for Quantum Phases, Emergent Degrees of Freedom, and Information Stability

Atanas Georgiev Aleksandrov

General Evolution Principle; Universal Condensation Principle

•Jun 7, 2026•0 citations

The Law of Reconstructive Observation

Yugo Matsumoto

I’ve uploaded a new preprint paper. This work proposes a natural law that describes observation not as passive perception, but as a continuous process of reconstruction constrained by fundamental limits such as the speed of light and sound. The paper connects physics, perception, and phenomenology through a simple mathematical framework, focusing on when and why observed reality remains stable—or collapses. Related updates may be available at: patreon.com/NMStructuralTheoryLab

•Dec 19, 2025•0 citations

A General Theory of Process: Unifying Physics, Intelligence, and Topology via Structural Isomorphism

Rowan Brad Quni-Gudzinas

•Jan 1, 2026•0 citations

Ring-LWE Identity-Based Encryption with Dynamic Revocation for Cloud Data Sharing

Gabriel Assamah, Alimatu Latiff Yussif, Benjamin Appiah +2 more

Cloud storage faces significant security and access control challenges due to reduced user oversight and the emerging threat of quantum computing to traditional cryptographic methods. Existing revocable Identity-Based Encryption (IBE) schemes are limited by their lack of post quantum security, inefficient revocation mechanisms that require re-encryption of data, and cumbersome key update procedures. We propose a post-quantum secure Ring-LWE IBE scheme with dynamic time-based revocation tailored for cloud environments. Our solution is built on the hardness of the Ring Learning with Errors (RLWE) problem to ensure quantum resistance and introduces a novel time-based revocation framework. In our approach, user access is bound to discrete periods and managed through a hierarchical binary tree structured over identities and time. This design eliminates the need to re-encrypt stored data upon user revocation. Instead, a trusted authority periodically distributes lightweight key updates exclusively to non-revoked users. Thanks to the binary tree structure, non-revoked users can compute updated decryption keys with only O (log Nₘₐₓ) overhead in both computation and communication, where Nₘₐₓ is the maximum number of users or periods. Revoked users, having no access to future updates, lose decryption capabilities. We provide formal security proofs showing the schemes resistance against adaptive identity and time-period-based attacks, grounded in the RLWE assumption. Overall, our scheme offers an effective combination of post-quantum security, efficient access control, and simplified key management, making it suitable for secure cloud data sharing in the quantum era.

Indian Journal of Cryptography and Network Security•Nov 25, 2025•0 citations
I’m posting Sukima Cloud Theory here. This paper presents a structural model in which existence, observation, and communication are treated as a single equilibrium process based on pressure dynamics. Shared for readers interested in non-temporal, non-interfering structural theories. Related updates may be available at: patreon.com/NMStructuralTheoryLab
I’ve shared updated versions of my work on Dynamic Probability Space Theory (DPS). These papers develop a framework in which probability itself is treated as a fundamental structural principle of existence, formalized through the Existence Field Equation and dynamic probability flow. Versions 1.2 and 1.3 are presented here as independent preprints, reflecting an ongoing theoretical exploration of reality, observation, and cognition. Related updates may be available at: patreon.com/NMStructuralTheoryLab
Cloud storage faces significant security and access control challenges due to reduced user oversight and the emerging threat of quantum computing to traditional cryptographic methods. Existing revocable Identity-Based Encryption (IBE) schemes are limited by their lack of post quantum security, inefficient revocation mechanisms that require re-encryption of data, and cumbersome key update procedures. We propose a post-quantum secure Ring-LWE IBE scheme with dynamic time-based revocation tailored for cloud environments. Our solution is built on the hardness of the Ring Learning with Errors (RLWE) problem to ensure quantum resistance and introduces a novel time-based revocation framework. In our approach, user access is bound to discrete periods and managed through a hierarchical binary tree structured over identities and time. This design eliminates the need to re-encrypt stored data upon user revocation. Instead, a trusted authority periodically distributes lightweight key updates exclusively to non-revoked users. Thanks to the binary tree structure, non-revoked users can compute updated decryption keys with only O (log Nₘₐₓ) overhead in both computation and communication, where Nₘₐₓ is the maximum number of users or periods. Revoked users, having no access to future updates, lose decryption capabilities. We provide formal security proofs showing the schemes resistance against adaptive identity and time-period-based attacks, grounded in the RLWE assumption. Overall, our scheme offers an effective combination of post-quantum security, efficient access control, and simplified key management, making it suitable for secure cloud data sharing in the quantum era.