Post-Quantum Signatureless Authorization
Authors/Creators
Description
Digital signatures authorize transactions, commands and other requests. Quantum attacks threaten widely used signature schemes. Their post-quantum replacements can be costly to verify inside proofs of execution. Signatureless authorization binds knowledge of an authority secret to a canonical request through a freshly randomized proof capsule. The public statement consists of a request identifier and a 32-byte authority commitment. Application rules enforce context, policy and freshness. The interface supports standalone requests and recursive proof composition.
The construction combines a masked degree-ten authority reduction over GF(2^128), embedded in GF(2^256), with a bank-and-companion code proof. Source restoration gives expected polynomial-time public-coin extraction with error at most 5^(-65) + 701202001642 / 2^255.
The quantum chosen-request authorization theorem reduces fresh-intent forgery to authority-preimage recovery and intent-binding failure, with explicit simulation and extraction losses. Its native model fixes the public authority circuit and its address input slice, then samples a uniform permutation completion elsewhere. Four distinct capacity roots and fixed-capacity two-block Merkle nodes support a shared native transcript and commitment permutation, with coherent forward and inverse queries.
For S <= T <= 2^32, where S counts authorization attempts and T counts charged native calls, the combined simulation and extraction loss is below 2^(-51). The security analysis specifies the primitive assumptions, the selected permutation’s algebraic structure and the AES-128 resource reference used in discussing concrete security strength.
Parano1d supplies a blockchain implementation and recursive verifier. The evaluated profile uses a 2,048-cell bank and 65 code queries, with canonical capsules bounded by 92,696 bytes. On an Intel Core i7-1365U laptop, median proving takes 1.38 to 1.43 seconds and native verification approximately 46 to 47 milliseconds for two request fixtures.
The reproducibility archive contains the manuscript sources, mathematical derivations, exact arithmetic checks, structural checks, recorded measurements, Rust reproduction programs and an authenticated source patch. Its README provides the reproduction commands.
Contact: dev@parano1d.org
The manuscript and written documentation are licensed under Creative Commons Attribution 4.0 International (CC BY 4.0). Original reproduction software is licensed under Apache-2.0. The source patch and restored project retain their applicable license notices. Third-party dependencies retain their respective licenses.
Files
post-quantum-signatureless-authorization.pdf
Additional details
Software
- Repository URL
- https://github.com/ignotusnemo/parano1d
- Programming language
- Rust
- Development Status
- Active