Search papers, labs, and topics across Lattice.
This paper introduces novel tools for creating redactable authenticated data structures that maintain post-quantum security by leveraging polynomial equations. The significance lies in the construction's reliance on the difficulty of solving multi-variable polynomial equations, which is currently deemed secure against quantum attacks. Key results indicate that by carefully selecting parameters, the proposed one-way function remains robust against known quantum algorithms, enhancing the security landscape for blockchain technologies.
Solving the proposed one-way function requires tackling complex polynomial equations, making it a formidable challenge even for quantum adversaries.
We develop new tools for constructing redactable authenticated data structures with post-quantum security. In our construction, inverting the proposed one-way function means solving a polynomial equation (or a system of polynomial equations) in more than one variable. This is presently considered quantum-safe, i.e., there is no known quantum algorithm that could solve this problem efficiently if parameters are chosen wisely.
