Online/Offline OR Composition of Sigma Protocols

DOI10.1007/978-3-662-49896-5_3zbMath1400.94137OpenAlexW2500910757MaRDI QIDQ5739198

Michele Ciampi, Alessandra Scafuro, Ivan Visconti, Giuseppe Persiano, Luisa Siniscalchi

Publication date: 15 July 2016

Published in: Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://link.springer.com/chapter/10.1007%2F978-3-662-49896-5_3

zbMATH Keywords

\(\varSigma\)-protocolsWIdelayed and adaptive inputPoKs

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (15)

Fiat-Shamir for highly sound protocols is instantiable ⋮ Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity ⋮ Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions ⋮ Efficient proofs of knowledge for threshold relations ⋮ DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF ⋮ Triply adaptive UC NIZK ⋮ Doubly adaptive zero-knowledge proofs ⋮ Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation ⋮ Cryptographic reverse firewalls for interactive proof systems ⋮ Delayed-input cryptographic protocols ⋮ Improved OR-Composition of Sigma-Protocols ⋮ On the power of secure two-party computation ⋮ Signatures from sequential-OR proofs ⋮ Fiat–Shamir for Highly Sound Protocols Is Instantiable ⋮ Concurrent Non-Malleable Commitments (and More) in 3 Rounds

This page was built for publication: Online/Offline OR Composition of Sigma Protocols