Efficient threshold encryption from lossy trapdoor functions

DOI10.1007/978-3-642-25405-5_11MaRDI QIDQ3102790zbMATH OpenOpenAlexFDO

Authors Xiang Xie, Rui Xue, Rui Zhang

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

zbMATH Keywords

latticeslossy trapdoor functionsthreshold public key encryption

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Provably secure threshold public-key encryption with adaptive security and short ciphertexts
• Threshold Public-Key Encryption with Adaptive Security and Short Ciphertexts
• Lossy trapdoor functions and their applications
• Efficient forward-secure threshold public key encryption
• Lossy Trapdoor Functions and Their Applications

Cites work

• scientific article; zbMATH DE number 176565 (Why is no real title available?)
• Advances in Cryptology - EUROCRYPT 2004
• An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract)
• Bonsai trees, or how to delegate a lattice basis
• Breaking and Repairing Damgård et al. Public Key Encryption Scheme with Non-interactive Opening
• Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
• How to share a secret
• Lossy trapdoor functions and their applications
• More constructions of lossy and correlation-secure trapdoor functions
• New hash functions and their use in authentication and set equality
• On lattices, learning with errors, random linear codes, and cryptography
• One-time signatures and chameleon hash functions
• Public Key Cryptography – PKC 2004
• Public-Key Encryption with Non-interactive Opening
• Public-key cryptosystems from the worst-case shortest vector problem
• Public-key encryption with non-interactive opening: new constructions and stronger definitions
• Securing threshold cryptosystems against chosen ciphertext attack
• Theory of Cryptography
• Theory of Cryptography
• Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
• Topics in Cryptology – CT-RSA 2006

Cited in

(7)

• More constructions of re-splittable threshold public key encryption
• Shrinking the keys of discrete-log-type lossy trapdoor functions
• Lossy Trapdoor Relation and Its Applications to Lossy Encryption and Adaptive Trapdoor Relation
• Lossy trapdoor functions from homomorphic reproducible encryption
• Lattice-based identity-based resplittable threshold public key encryption scheme
• Efficient range-trapdoor functions and applications: rate-1 OT and more
• Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings

This page was built for publication: Efficient threshold encryption from lossy trapdoor functions

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