Automatic generation of -protocols

DOI10.1007/978-3-642-16441-5_5MaRDI QIDQ3072710zbMATH OpenOpenAlexFDO

Authors Endre Bangerter, Thomas Briner, Wilko Henecka, Stephan Krenn, Ahmad-Reza Sadeghi, Thomas Schneider

Publication date 4 February 2011

Published in Public Key Infrastructures, Services and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-16441-5_5

zbMATH Keywords

language designprotocol compilerzero-knowledge

Mathematics Subject Classification ID

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

Recommendations

• Efficient signatures of knowledge and DAA in the standard model
• A framework for practical universally composable zero-knowledge protocols
• Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use
• An Efficient Compiler from Σ-Protocol to 2-Move Deniable Zero-Knowledge
• Unifying Zero-Knowledge Proofs of Knowledge

Cited in

(2)

• Automated Synthesis of Protocol Converters with BALM-II
• Bounded verification for finite-field-blasting. In a compiler for zero knowledge proofs

This page was built for publication: Automatic generation of \(\Sigma\)-protocols

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