Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use

DOI10.1007/978-3-540-75670-5_8zbMath1138.94350OpenAlexW2122600301MaRDI QIDQ3503874

Jacques Traoré, Iwen Coisel, Sébastien Canard

Publication date: 10 June 2008

Published in: Provable Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75670-5_8

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (max. 100)

Removing the Strong RSA Assumption from Arguments over the Integers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the fly authentication and signature schemes based on groups of unknown order
• Zero-knowledge proofs of identity
• Efficient signature generation by smart cards
• Security arguments for digital signatures and blind signatures
• RSA-based undeniable signatures
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• The Knowledge Complexity of Interactive Proof Systems
• 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
• Advances in Cryptology - EUROCRYPT 2004

This page was built for publication: Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use