Lossy trapdoor functions from homomorphic reproducible encryption
From MaRDI portal
(Redirected from Publication:456129)
Recommendations
Cites work
- scientific article; zbMATH DE number 176565 (Why is no real title available?)
- scientific article; zbMATH DE number 2086698 (Why is no real title available?)
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Advances in Cryptology - CRYPTO 2003
- Chosen-ciphertext security from slightly lossy trapdoor functions
- Foundations of Cryptography
- Lossy trapdoor functions and their applications
- More constructions of lossy and correlation-secure trapdoor functions
- Multirecipient Encryption Schemes: How to Save on Bandwidth and Computation Without Sacrificing Security
- New directions in cryptography
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- On homomorphic encryption and chosen-ciphertext security
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Probabilistic encryption
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Synthesizers and their application to the parallel construction of pseudo-random functions
Cited in
(7)- Reproducible circularly-secure bit encryption: applications and realizations
- Reproducible circularly secure bit encryption: applications and realizations
- Lossy Trapdoor Functions and Their Applications
- Lossy Trapdoor Relation and Its Applications to Lossy Encryption and Adaptive Trapdoor Relation
- Compact Lossy and All-but-One Trapdoor Functions from Lattice
- Cumulatively all-lossy-but-one trapdoor functions from standard assumptions
- Updatable Lossy Trapdoor Functions and Its Application in Continuous Leakage
This page was built for publication: Lossy trapdoor functions from homomorphic reproducible encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456129)