Efficient Threshold Encryption from Lossy Trapdoor Functions
From MaRDI portal
Publication:3102790
DOI10.1007/978-3-642-25405-5_11zbMath1279.94126MaRDI QIDQ3102790
Publication date: 25 November 2011
Published in: Post-Quantum Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25405-5_11
Related Items
Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings, Lattice-based identity-based resplittable threshold public key encryption scheme
Cites Work
- Unnamed Item
- New hash functions and their use in authentication and set equality
- How to share a secret
- One-Time Signatures and Chameleon Hash Functions
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Lossy trapdoor functions and their applications
- Public-Key Encryption with Non-Interactive Opening: New Constructions and Stronger Definitions
- More Constructions of Lossy and Correlation-Secure Trapdoor Functions
- Bonsai Trees, or How to Delegate a Lattice Basis
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Breaking and Repairing Damgård et al. Public Key Encryption Scheme with Non-interactive Opening
- Securing threshold cryptosystems against chosen ciphertext attack
- An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract)
- Public-key cryptosystems from the worst-case shortest vector problem
- Advances in Cryptology - EUROCRYPT 2004
- Public-Key Encryption with Non-interactive Opening
- Theory of Cryptography
- Theory of Cryptography
- Topics in Cryptology – CT-RSA 2006
- On lattices, learning with errors, random linear codes, and cryptography
- Public Key Cryptography – PKC 2004
