Delayed-input cryptographic protocols

DOI10.1007/978-3-319-58741-7_12zbMATH Open1489.94109OpenAlexW2612730636MaRDI QIDQ2011641FDOQ2011641

Authors: Ivan Visconti 

Publication date: 4 August 2017

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

Recommendations

• Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds
• On adaptive security of delayed-input sigma protocols and Fiat-Shamir NIZKs
• Round optimal black-box ``commit-and-prove
• Online/offline OR composition of sigma protocols
• Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness

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

• Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
• Title not available (Why is that?)
• Advances in Cryptology – CRYPTO 2004
• Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model
• 4-round resettably-sound zero knowledge
• Advances in Cryptology – CRYPTO 2004
• Improved OR-composition of sigma-protocols
• On the Power of Secure Two-Party Computation
• Concurrent non-malleable commitments (and more) in 3 rounds
• Fiat-Shamir for highly sound protocols is instantiable
• Online/offline OR composition of sigma protocols
• Improved Setup Assumptions for 3-Round Resettable Zero Knowledge

Cited In (2)

• Applied Cryptography and Network Security
• Delayed password disclosure

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011641)