Removing the Strong RSA Assumption from Arguments over the Integers

DOI10.1007/978-3-319-56614-6_11zbMath1415.94420DBLPconf/eurocrypt/CouteauPP17OpenAlexW2612871929WikidataQ56920941 ScholiaQ56920941MaRDI QIDQ5738979

No author found.

Publication date: 13 June 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-56614-6_11

zbMATH Keywords

public-key cryptographyzero-knowledge proofscommitment schemesRSA assumptioninteractive arguments of knowledge

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

Zero-knowledge proofs for set membership: efficient, succinct, modular ⋮ Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model ⋮ Zero-knowledge arguments for subverted RSA groups ⋮ Zero-knowledge range arguments for signed fractional numbers from lattices ⋮ Succinct Diophantine-satisfiability arguments ⋮ Removing the Strong RSA Assumption from Arguments over the Integers ⋮ Zero-knowledge proofs for set membership: efficient, succinct, modular ⋮ Transparent SNARKs from DARK compilers ⋮ Efficient range proofs with transparent setup from bounded integer commitments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The decision problem for exponential diophantine equations
• On the bounded version of Hilbert's tenth problem
• Security arguments for digital signatures and blind signatures
• Encryption Switching Protocols
• Security Proofs for Signature Schemes
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
• Secure Vickrey Auctions without Threshold Trust
• Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments
• Short Signatures from Weaker Assumptions
• Linear Algebra with Sub-linear Zero-Knowledge Arguments
• Short and Stateless Signatures from the RSA Assumption
• Efficient, Robust and Constant-Round Distributed RSA Key Generation
• Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use
• Non-interactive Zero-Knowledge Arguments for Voting
• Efficient Protocols for Set Membership and Range Proofs
• Randomized algorithms in number theory
• A method for obtaining digital signatures and public-key cryptosystems
• Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
• Practical Signatures from Standard Assumptions
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Compact E-Cash
• Efficient Two-Party Secure Computation on Committed Inputs
• Removing the Strong RSA Assumption from Arguments over the Integers
• Advances in Cryptology - ASIACRYPT 2003

This page was built for publication: Removing the Strong RSA Assumption from Arguments over the Integers