Efficient cryptosystems from 2ᵏ-th power residue symbols

Recommendations

Efficient cryptosystems from \(2^k\)-th power residue symbols
New assumptions and efficient cryptosystems from the \(e\)-th power residue symbol
The distribution of quadratic residues and non-residues in the Goldwasser-Micali type of cryptosystem. II
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
scientific article; zbMATH DE number 1303131

Cites work

scientific article; zbMATH DE number 1618043 (Why is no real title available?)
scientific article; zbMATH DE number 1722964 (Why is no real title available?)
scientific article; zbMATH DE number 3864496 (Why is no real title available?)
scientific article; zbMATH DE number 47996 (Why is no real title available?)
scientific article; zbMATH DE number 177049 (Why is no real title available?)
scientific article; zbMATH DE number 1303131 (Why is no real title available?)
scientific article; zbMATH DE number 2053186 (Why is no real title available?)
scientific article; zbMATH DE number 1759305 (Why is no real title available?)
scientific article; zbMATH DE number 2204782 (Why is no real title available?)
A New Randomness Extraction Paradigm for Hybrid Encryption
A Simple Unpredictable Pseudo-Random Number Generator
A public-key cryptosystem using purely cubic fields
A public-key cryptosystem utilizing cyclotomic fields
Advances in Cryptology - EUROCRYPT 2004
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.)
Better security for deterministic public-key encryption: the auxiliary-input setting
Chosen-ciphertext security from slightly lossy trapdoor functions
Deterministic and Efficiently Searchable Encryption
Dual projective hashing and its applications -- lossy trapdoor functions and more
Extended-DDH and lossy trapdoor functions
Fast Generation of Prime Numbers on Portable Devices: An Update
Foundations of Cryptography
Generic Homomorphic Undeniable Signatures
Hedged public-key encryption: how to protect against bad randomness
Instantiability of RSA-OAEP under chosen-plaintext attack
Introduction to modern cryptography
Lossy trapdoor functions and their applications
Magic functions
More constructions of lossy and correlation-secure trapdoor functions
More constructions of lossy and correlation-secure trapdoor functions
On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
On lattices, learning with errors, random linear codes, and cryptography
Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
Practical chosen ciphertext secure encryption from factoring
Probabilistic encryption
Public Key Cryptography – PKC 2004
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Public-key cryptanalysis
Receipt-free secret-ballot elections (extended abstract)
Small solutions to polynomial equations, and low exponent RSA vulnerabilities
Theory of Cryptography
Tighter Reductions for Forward-Secure Signature Schemes

Cited in

(9)

Efficient cryptosystems from \(2^k\)-th power residue symbols
New assumptions and efficient cryptosystems from the \(e\)-th power residue symbol
Rinocchio: SNARKs for ring arithmetic
An algebraic framework for silent preprocessing with trustless setup and active security
Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \)
Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\)
Compact selective opening security from LWE
Sherlock Holmes zero-knowledge protocols
On the tightness of forward-secure signature reductions

This page was built for publication: Efficient cryptosystems from \(2^k\)-th power residue symbols

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