Delayed-input cryptographic protocols

DOI10.1007/978-3-319-58741-7_12zbMath1489.94109OpenAlexW2612730636MaRDI QIDQ2011641

Ivan Visconti

Publication date: 4 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-58741-7_12

zbMATH Keywords

delayed-input witness-indistinguishable proof of knowledgeround-efficient protocols

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Improved OR-Composition of Sigma-Protocols
• Fiat–Shamir for Highly Sound Protocols Is Instantiable
• On the Power of Secure Two-Party Computation
• Concurrent Non-Malleable Commitments (and More) in 3 Rounds
• Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology – CRYPTO 2004
• Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model
• Improved Setup Assumptions for 3-Round Resettable Zero Knowledge
• Online/Offline OR Composition of Sigma Protocols
• 4-Round Resettably-Sound Zero Knowledge

This page was built for publication: Delayed-input cryptographic protocols