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