Efficient cryptosystems from \(2^k\)-th power residue symbols
From MaRDI portal
Publication:2397448
DOI10.1007/s00145-016-9229-5zbMath1377.94035OpenAlexW2483232135MaRDI QIDQ2397448
Fabrice Benhamouda, Javier Herranz, Marc Joye, Benoît Libert
Publication date: 22 May 2017
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-016-9229-5
standard modelpublic-key encryptionhomomorphic encryptionquadratic residuosityGoldwasser-Micali cryptosystem
Related Items (6)
Rinocchio: SNARKs for ring arithmetic ⋮ Sherlock Holmes zero-knowledge protocols ⋮ Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\) ⋮ An algebraic framework for silent preprocessing with trustless setup and active security ⋮ On the tightness of forward-secure signature reductions ⋮ Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic encryption
- A public-key cryptosystem using purely cubic fields
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- A public-key cryptosystem utilizing cyclotomic fields
- More constructions of lossy and correlation-secure trapdoor functions
- Practical chosen ciphertext secure encryption from factoring
- Receipt-free secret-ballot elections (extended abstract)
- Dual Projective Hashing and Its Applications — Lossy Trapdoor Functions and More
- Extended-DDH and Lossy Trapdoor Functions
- Magic Functions
- Fast Generation of Prime Numbers on Portable Devices: An Update
- Lossy trapdoor functions and their applications
- More Constructions of Lossy and Correlation-Secure Trapdoor Functions
- Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions
- Instantiability of RSA-OAEP under Chosen-Plaintext Attack
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- Deterministic and Efficiently Searchable Encryption
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- A New Randomness Extraction Paradigm for Hybrid Encryption
- Hedged Public-Key Encryption: How to Protect against Bad Randomness
- A Simple Unpredictable Pseudo-Random Number Generator
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Foundations of Cryptography
- Tighter Reductions for Forward-Secure Signature Schemes
- Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting
- Advances in Cryptology - EUROCRYPT 2004
- Generic Homomorphic Undeniable Signatures
- Theory of Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- Public Key Cryptography – PKC 2004
This page was built for publication: Efficient cryptosystems from \(2^k\)-th power residue symbols
