Compact privacy protocols from post-quantum and timed classical assumptions

DOI10.1007/978-3-030-44223-1_13MaRDI QIDQ5041222zbMATH OpenOpenAlexFDO

Authors Jonathan Bootle, Anja Lehmann, Vadim Lyubashevsky, Gregor Seiler

Publication date 13 October 2022

Published in Post-Quantum Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-44223-1_13

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Recommendations

• Efficient post-quantum SNARKs for RSIS and RLWE and their applications to privacy
• Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
• Post-quantum one-time linkable ring signature and application to ring confidential transactions in blockchain (lattice ringct v1.0)
• A non-PCP approach to succinct quantum-safe zero-knowledge
• A scalable post-quantum hash-based group signature

Cites work

• A new identification scheme based on syndrome decoding
• Advances in Cryptology – CRYPTO 2004
• Better zero-knowledge proofs for lattice encryption and their application to group signatures
• Efficient identity-based encryption over NTRU lattices
• Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
• Fast Fourier orthogonalization
• Generalized Compact Knapsacks Are Collision Resistant
• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• scientific article; zbMATH DE number 1952906 (Why is no real title available?)
• scientific article; zbMATH DE number 1962147 (Why is no real title available?)
• scientific article; zbMATH DE number 2009983 (Why is no real title available?)
• Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
• Lattice signatures without trapdoors
• MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
• NTRU prime: reducing attack surface at low cost
• On the Indifferentiability of the Sponge Construction
• Short discrete log proofs for FHE and ring-LWE ciphertexts
• Short randomizable signatures
• Theory of Cryptography
• Topics in Cryptology – CT-RSA 2005
• Trapdoors for hard lattices and new cryptographic constructions
• Verifiable delay functions from supersingular isogenies and pairings

Cited in

(1)

• Efficient range proofs with transparent setup from bounded integer commitments

Describes a project that uses

Uses Software

• NTRU
• NTRUSign
• GitHub
• MiMC

This page was built for publication: Compact privacy protocols from post-quantum and timed classical assumptions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041222)