A new public-key cryptosystem as secure as factoring
From MaRDI portal
(Redirected from A new public-key cryptosystem as secure as factoring)
Recommendations
- A practical public key cryptosystem from Paillier and Rabin schemes
- Public-key cryptosystems based on composite degree residuosity classes
- A public key cryptosystem based on a subgroup membership problem
- A new public-key cryptosystem over a quadratic order with quadratic decryption time.
- A new public key cryptosystem over \(\mathbb Z_{n^2}^\ast\)
Cited in
(72)- Hybrid commitments and their applications to zero-knowledge proof systems
- Group homomorphic encryption: characterizations, impossibility results, and applications
- Secure integration of asymmetric and symmetric encryption schemes
- A new public-key cryptosystem over a quadratic order with quadratic decryption time.
- A new public key cryptosystem based on Edwards curves
- New number-theoretic cryptographic primitives
- Algebraic secret sharing using privacy homomorphisms for IoT-based healthcare systems
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model
- An efficient privacy-preserving compressive data gathering scheme in WSNs
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- Privacy-preserving anomaly detection in cloud with lightweight homomorphic encryption
- Homomorphic public-key cryptosystems and encrypting Boolean circuits
- A public key cryptosystem based on a subgroup membership problem
- Public-key cryptography and invariant theory
- On non-Abelian homomorphic public-key cryptosystems
- Revisiting prime power RSA
- Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\)
- Cryptographic algorithms for privacy-preserving online applications
- On the security of a Williams based public key encryption scheme
- Linearly homomorphic encryption from \(\mathsf {DDH}\)
- A new Rabin-type trapdoor permutation equivalent to factoring
- Factoring multi-power RSA moduli with primes sharing least or most significant bits
- Primeless factoring-based cryptography. Solving the complexity bottleneck of public-key generation
- Benaloh's dense probabilistic encryption revisited
- Provably Secure Key Assignment Schemes from Factoring
- scientific article; zbMATH DE number 2085418 (Why is no real title available?)
- Algebraic cryptography: new constructions and their security against provable break
- A secure \(M + 1^{\text{st}}\) price auction protocol based on bit slice circuits
- A public key cryptoscheme using bit-pairs with provable semantical security
- New weak keys in RSA
- A semantically secure public key cryptoscheme using bit-pair shadows
- Public-Key Cryptosystems with Primitive Power Roots of Unity
- Two Generic Constructions of Probabilistic Cryptosystems and Their Applications
- A Watermarking Scheme in the Encrypted Domain for Watermarking Protocol
- Some Public-Key Crypto-Functions as Intractable as Factorization
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
- PUBLIC KEY CRYPTOSYSTEM USING A RECIPROCAL NUMBER WITH THE SAME INTRACTABILITY AS FACTORING A LARGE NUMBER
- Small secret exponent attack on RSA variant with modulus N=p^rq
- New public key cryptosystems based on the dependent-RSA problems
- Public-key cryptosystem design based on factoring and discrete logarithms
- A practical public key cryptosystem from Paillier and Rabin schemes
- An efficient IND-CCA2 secure Paillier-based cryptosystem
- A new public key cryptosystem over \(\mathbb Z_{n^2}^\ast\)
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- Formal and precise analysis of soundness of several shuffling schemes
- Provably secure Rabin-p cryptosystem in hybrid setting
- A new public key encryption scheme based on two cryptographic assumptions
- Homomorphic Encryptions of Sums of Groups
- Progress in Cryptology – Mycrypt 2005
- Optimally sound sigma protocols under DCRA
- A verifiable secret shuffle of homomorphic encryptions
- A generalized attack on the multi-prime power RSA
- Short-lived zero-knowledge proofs and signatures
- Cryptanalysis of the multi-power RSA cryptosystem variant
- Vector commitments over rings and compressed -protocols
- Improved cryptanalysis of the multi-power RSA cryptosystem variant
- On Extension of Evaluation Algorithms in Keyed-Homomorphic Encryption
- Element distinctness and bounded input size in private set intersection and related protocols
- Investigation of an attack on the multi-prime RSA cryptosystem based on cubic equations
- Secure function extensions to additively homomorphic cryptosystems
- Partial key exposure attacks on Prime Power RSA with non-consecutive blocks
- On sigma-protocols and (packed) black-box secret sharing schemes
- Fast square-free decomposition of integers using class groups
- Resolving the efficiency-utility dilemma of threshold linearly homomorphic encryption via message-space adapter
- New results on the -hiding assumption and factoring related RSA moduli
- Exponent-VRFs and their applications
- The case of small prime numbers versus the Okamoto-Uchiyama cryptosystem
- A new public key cryptosystem based on the cubic Pell curve
- Error-correctable efficient quantum homomorphic encryption using Calderbank-Shor-Steane codes
- A new generalization of the KMOV cryptosystem
- Spreading alerts quietly and the subgroup escape problem
- On the security of public key cryptosystems with a double decryption mechanism
This page was built for publication: A new public-key cryptosystem as secure as factoring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249647)
