One-Shot Verifiable Encryption from Lattices

DOI10.1007/978-3-319-56620-7_11zbMath1411.94076OpenAlexW2594057045MaRDI QIDQ5738881

Gregory Neven, Vadim Lyubashevsky

Publication date: 13 June 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-56620-7_11

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (13)

Lattice-based proof of shuffle and applications to electronic voting ⋮ Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs ⋮ Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications ⋮ Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations ⋮ Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general ⋮ MuSig-L: lattice-based multi-signature with single-round online phase ⋮ Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs ⋮ Verifiable Decryption for Fully Homomorphic Encryption ⋮ Post-quantum asynchronous deniable key exchange and the signal handshake ⋮ \textsf{DualMS}: efficient lattice-based two-round multi-signature with trapdoor-free simulation ⋮ Blockchain-based two-party fair contract signing scheme ⋮ Non-interactive zero-knowledge in pairing-free groups from weaker assumptions ⋮ Efficient range proofs with transparent setup from bounded integer commitments

Uses Software

• BKZ
• NTRU

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to Prove Knowledge of Small Secrets
• A Subfield Lattice Attack on Overstretched NTRU Assumptions
• On the Non-malleability of the Fiat-Shamir Transform
• Lattice Signatures without Trapdoors
• Multiparty Computation from Somewhat Homomorphic Encryption
• Efficient Identity-Based Encryption over NTRU Lattices
• Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures
• An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
• Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
• BKZ 2.0: Better Lattice Security Estimates
• Trapdoors for hard lattices and new cryptographic constructions
• Generalized Compact Knapsacks Are Collision Resistant
• On the Portability of Generalized Schnorr Proofs
• Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
• Efficient Public Key Encryption Based on Ideal Lattices
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Group Signatures
• Auto-recoverable auto-certifiable cryptosystems
• Optimistic fair exchange of digital signatures
• A new identification scheme based on syndrome decoding
• Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
• On Ideal Lattices and Learning with Errors over Rings
• Advances in Cryptology - CRYPTO 2003
• Predicting Lattice Reduction
• Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack
• On Signatures of Knowledge
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: One-Shot Verifiable Encryption from Lattices