Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems

DOI10.1007/978-3-642-11799-2_13zbMath1274.94040OpenAlexW1565128838MaRDI QIDQ3408195

Rikke Bendlin, Ivan B. Damgård

Publication date: 24 February 2010

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11799-2_13

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items

Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography ⋮ Efficient lattice-based polynomial evaluation and batch ZK arguments ⋮ Adaptively secure distributed PRFs from LWE ⋮ Adaptively secure threshold symmetric-key encryption ⋮ Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption ⋮ Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption ⋮ Verifiable decryption in the head ⋮ Mixed-technique multi-party computations composed of two-party computations ⋮ Chosen-ciphertext secure code-based threshold public key encryptions with short ciphertext ⋮ Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection ⋮ ParaDiSE: efficient threshold authenticated encryption in fully malicious model ⋮ An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption ⋮ Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications ⋮ Lattice-based identity-based resplittable threshold public key encryption scheme ⋮ Adaptively secure distributed PRFs from \(\mathsf{LWE}\) ⋮ Revocable attribute-based proxy re-encryption ⋮ The Geometry of Lattice Cryptography ⋮ Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings ⋮ Efficient Threshold Encryption from Lossy Trapdoor Functions ⋮ Actively secure setup for SPDZ

Cites Work

• Unnamed Item
• How to share a secret
• A Framework for Efficient and Composable Oblivious Transfer
• Statistical secrecy and multibit commitments
• Public-key cryptosystems from the worst-case shortest vector problem
• Perfectly-Secure MPC with Linear Communication Complexity
• Theory of Cryptography
• On lattices, learning with errors, random linear codes, and cryptography