Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions

DOI10.1007/978-3-030-44223-1_13zbMath1501.94030OpenAlexW3015585376MaRDI QIDQ5041222

Anja Lehmann, Jonathan Bootle, 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

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

Related Items (1)

Efficient range proofs with transparent setup from bounded integer commitments

Uses Software

• NTRU
• NTRUSign
• GitHub
• MiMC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• NTRU prime: reducing attack surface at low cost
• Verifiable delay functions from supersingular isogenies and pairings
• Short discrete log proofs for FHE and ring-LWE ciphertexts
• Short Randomizable Signatures
• Lattice Signatures without Trapdoors
• Efficient Identity-Based Encryption over NTRU Lattices
• Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures
• MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
• Fast Fourier Orthogonalization
• Trapdoors for hard lattices and new cryptographic constructions
• Generalized Compact Knapsacks Are Collision Resistant
• A new identification scheme based on syndrome decoding
• Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
• Advances in Cryptology – CRYPTO 2004
• On the Indifferentiability of the Sponge Construction
• Topics in Cryptology – CT-RSA 2005
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
• Theory of Cryptography

This page was built for publication: Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions