Online/offline OR composition of sigma protocols

DOI10.1007/978-3-662-49896-5_3MaRDI QIDQ5739198zbMATH OpenOpenAlexFDO

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

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\)-protocolsdelayed and adaptive inputPoKsWI

Mathematics Subject Classification ID

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

Recommendations

• Non-interactive composition of sigma-protocols via Share-then-Hash
• scientific article; zbMATH DE number 883898
• On adaptive security of delayed-input sigma protocols and Fiat-Shamir NIZKs
• Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
• scientific article; zbMATH DE number 1406779

Cited in

(26)

• Fiat-Shamir for highly sound protocols is instantiable
• Delayed-input cryptographic protocols
• Signatures from sequential-OR proofs
• Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
• Cryptographic reverse firewalls for interactive proof systems
• On the power of secure two-party computation
• Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
• Non-interactive composition of sigma-protocols via Share-then-Hash
• Improved OR-composition of sigma-protocols
• Fiat-Shamir for highly sound protocols is instantiable
• Concurrent non-malleable commitments (and more) in 3 rounds
• Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
• scientific article; zbMATH DE number 883898 (Why is no real title available?)
• 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
• CDS composition of multi-round protocols
• Compact proofs of partial knowledge for overlapping CNF formulae
• Hybrid zero-knowledge from garbled circuits and circuit-based composition of -protocols
• Cryptographic reverse firewalls for interactive proof systems
• Hybrid zero-knowledge from garbled circuits
• Four-round statistical non-malleable zero-knowledge
• Robust non-interactive zero-knowledge combiners
• Critical rounds in multi-round proofs: proof of partial knowledge and trapdoor commitments

This page was built for publication: Online/offline OR composition of sigma protocols

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