Implicit zero-knowledge arguments and applications to the malicious setting

DOI10.1007/978-3-662-48000-7_6MaRDI QIDQ3457062zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Fabrice Benhamouda, Geoffroy Couteau, David Pointcheval, Hoeteck Wee

Publication date 10 December 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-48000-7_6

zbMATH Keywords

hash proof systemsinner productmalicious adversariestwo-party computationzero-knowledge

Mathematics Subject Classification ID

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

Recommendations

• Zero-knowledge proofs from secure multiparty computation
• Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
• Non-interactive zero knowledge from sub-exponential DDH
• scientific article; zbMATH DE number 1775426
• Constant-round leakage-resilient zero-knowledge argument for NP from the knowledge-of-exponent assumption

Cites work

• A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
• An algebraic framework for Diffie-Hellman assumptions
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• Efficient Identity-Based Encryption Without Random Oracles
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Efficient secure two-party computation using symmetric cut-and-choose
• Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
• High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
• How not to prove yourself: pitfalls of the fiat-shamir heuristic and applications to helios
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Minimum disclosure proofs of knowledge
• New techniques for SPHFs and efficient one-round PAKE protocols
• Practical covert authentication
• Programmable hash functions and their applications
• Round-optimal privacy-preserving protocols with smooth projective hash functions
• Secure two-party computation via cut-and-choose oblivious transfer
• Signatures resilient to continual leakage on memory and computation
• SPHF-friendly non-interactive commitments
• The Knowledge Complexity of Interactive Proof Systems
• The random oracle methodology, revisited.
• Two-output secure computation with malicious adversaries

Cited in

(7)

• New approach to practical leakage-resilient public-key cryptography
• Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
• Towards malicious security of private coin honest verifier zero knowledge for NP via witness encryption
• Equivalences and black-box separations of matrix Diffie-Hellman problems
• Short concurrent covert authenticated key exchange (short cAKE)
• A computational Diffie-Hellman-based insider secure signcryption with non-interactive non-repudiation
• OneTwoPAKE: two-round strong asymmetric PAKE with ideal security

This page was built for publication: Implicit zero-knowledge arguments and applications to the malicious setting

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