Zero-knowledge arguments for subverted RSA groups
From MaRDI portal
Publication:6088994
DOI10.1007/978-3-031-31371-4_18zbMath1526.94035OpenAlexW4367593095MaRDI QIDQ6088994
Mikhail Volkhov, Dimitris Kolonelos, Mary Maller
Publication date: 16 November 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-31371-4_18
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the amortized complexity of zero-knowledge protocols
- Efficient designated-verifier non-interactive zero-knowledge proofs of knowledge
- Hashing solutions instead of generating problems: on the interactive certification of RSA moduli
- Efficient range proofs with transparent setup from bounded integer commitments
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- A compressed \(\varSigma \)-protocol theory for lattices
- Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms
- Efficient noninteractive certification of RSA moduli and beyond
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Linearly Homomorphic Encryption from $$\mathsf {DDH}$$
- BLAKE2: Simpler, Smaller, Fast as MD5
- Secure Multi-Party Computation with Identifiable Abort
- Efficiency Limitations of Σ-Protocols for Group Homomorphisms Revisited
- On the Amortized Complexity of Zero-Knowledge Protocols
- Efficiency Limitations for Σ-Protocols for Group Homomorphisms
- Lossy trapdoor functions and their applications
- Non-interactive Zero-Knowledge Arguments for Voting
- On the Portability of Generalized Schnorr Proofs
- Randomized algorithms in number theory
- A practical and provably secure scheme for publicly verifiable secret sharing and its applications
- Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- Practical Signatures from Standard Assumptions
- Advances in Cryptology – CRYPTO 2004
- Efficient Non-interactive Range Proof
- Public Key Cryptography - PKC 2005
- Theory of Cryptography
- Removing the Strong RSA Assumption from Arguments over the Integers
- Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
- Cryptography and Coding
- Theory of Cryptography
- Public Key Cryptography - PKC 2006
- Advances in Cryptology - ASIACRYPT 2003
- Advances in Cryptology - ASIACRYPT 2003
