On the power of secure two-party computation

DOI10.1007/S00145-019-09314-2zbMath1455.94165OpenAlexW2913169702WikidataQ128490930 ScholiaQ128490930MaRDI QIDQ2303458

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam

Publication date: 3 March 2020

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-019-09314-2

zbMATH Keywords

secure two-party computationrandomized encodinginstance-dependent commitmentsadaptive zero-knowledge proofs

Mathematics Subject Classification ID

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

Uses Software

• Ligero
• ZKBoo

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
• A language-dependent cryptographic primitive
• Key-dependent message security: generic amplification and completeness
• Bit commitment using pseudorandomness
• A proof of security of Yao's protocol for two-party computation
• Minimum disclosure proofs of knowledge
• Adaptively indistinguishable garbled circuits
• Efficient adaptively secure zero-knowledge from garbled circuits
• Adaptive versus non-adaptive security of multi-party protocols
• How to construct constant-round zero-knowledge proof systems for NP
• Security and composition of multiparty cryptographic protocols
• A new interactive hashing theorem
• Improved OR-Composition of Sigma-Protocols
• A minimal model for secure computation (extended abstract)
• Secure Protocol Transformations
• Adaptively Secure Garbled Circuits from One-Way Functions
• Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys
• Additively Homomorphic UC Commitments with Optimal Amortized Overhead
• Adaptive Security of Yao’s Garbled Circuits
• Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
• Founding Cryptography on Tamper-Proof Hardware Tokens
• Statistical Randomized Encodings: A Complexity Theoretic View
• Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
• Bounded Key-Dependent Message Security
• Zero-Knowledge Proofs from Secure Multiparty Computation
• Universally composable two-party and multi-party secure computation
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
• From Secrecy to Soundness: Efficient Verification via Secure Computation
• One-Time Programs
• Founding Cryptography on Oblivious Transfer – Efficiently
• Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
• Secure Arithmetic Computation with No Honest Majority
• Black-Box Constructions of Two-Party Protocols from One-Way Functions
• Secure Two-Party Computation Is Practical
• The Knowledge Complexity of Interactive Proof Systems
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
• Foundations of Cryptography
• Equivocating Yao
• Black-box non-black-box zero knowledge
• Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way
• Advances in Cryptology – CRYPTO 2004
• OT-Combiners via Secure Computation
• An Equivalence Between Zero Knowledge and Commitments
• Online/Offline OR Composition of Sigma Protocols
• Probabilistically Checkable Proofs of Proximity with Zero-Knowledge
• Scalable Secure Multiparty Computation
• Cryptography in $NC^0$

This page was built for publication: On the power of secure two-party computation