On the Power of Secure Two-Party Computation
From MaRDI portal
Publication:2829222
DOI10.1007/978-3-662-53008-5_14zbMATH Open1372.94429OpenAlexW2400112050MaRDI QIDQ2829222FDOQ2829222
Muthuramakrishnan Venkitasubramaniam, Carmit Hazay
Publication date: 27 October 2016
Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53008-5_14
Recommendations
- On the power of secure two-party computation
- Data and Applications Security XIX
- scientific article; zbMATH DE number 1942420
- Publication:4941849
- Secure two-party computation is practical
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
- Advances in Cryptology – CRYPTO 2004
- Efficient Two-Party Secure Computation on Committed Inputs
- Towards secure two-party computation from the wire-tap channel
- Towards characterizing securely computable two-party randomized functions
secure two-party computationrandomized encodinginstance-dependent commitmentsadaptive zero-knowledge proofsinteractive hashing
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Network protocols (68M12)
Cites Work
- Bit commitment using pseudorandomness
- A proof of security of Yao's protocol for two-party computation
- Perfect zero-knowledge arguments for NP using any one-way permutation
- Title not available (Why is that?)
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
- Founding Cryptography on Oblivious Transfer – Efficiently
- Secure Arithmetic Computation with No Honest Majority
- The Knowledge Complexity of Interactive Proof Systems
- Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- From Secrecy to Soundness: Efficient Verification via Secure Computation
- Secure two-party computation is practical
- Cryptography in $NC^0$
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Title not available (Why is that?)
- A minimal model for secure computation (extended abstract)
- Advances in Cryptology – CRYPTO 2004
- An Equivalence Between Zero Knowledge and Commitments
- Theory of Cryptography
- Title not available (Why is that?)
- Universally composable two-party and multi-party secure computation
- A language-dependent cryptographic primitive
- Adaptive versus non-adaptive security of multi-party protocols
- Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
- Founding Cryptography on Tamper-Proof Hardware Tokens
- Title not available (Why is that?)
- OT-Combiners via Secure Computation
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
- Scalable Secure Multiparty Computation
- Bounded Key-Dependent Message Security
- Zero-Knowledge Proofs from Secure Multiparty Computation
- Key-dependent message security: generic amplification and completeness
- Adaptively Secure Garbled Circuits from One-Way Functions
- Title not available (Why is that?)
- Improved OR-Composition of Sigma-Protocols
- One-Time Programs
- Black-box non-black-box zero knowledge
- Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way
- Additively Homomorphic UC Commitments with Optimal Amortized Overhead
- Probabilistically Checkable Proofs of Proximity with Zero-Knowledge
- Secure Protocol Transformations
- A new interactive hashing theorem
- Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
Cited In (29)
- Adaptively secure computation for RAM programs
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
- On statistical security in two-party computation
- Towards a unified approach to black-box constructions of zero-knowledge proofs
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
- Delayed-input cryptographic protocols
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations
- Round optimal black-box ``commit-and-prove
- Covert two-party computation
- Fiat–Shamir for Highly Sound Protocols Is Instantiable
- Fiat-Shamir for highly sound protocols is instantiable
- Steganography-free zero-knowledge
- Round-optimal black-box commit-and-prove with succinct communication
- On perfectly secure 2PC in the OT-hybrid model
- Triply adaptive UC NIZK
- Concurrent Non-Malleable Commitments (and More) in 3 Rounds
- Secure Protocol Transformations
- On perfectly secure two-party computation for symmetric functionalities with correlated randomness
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
- Adaptively secure MPC with sublinear communication complexity
- On the power of secure two-party computation
- Hybrid zero-knowledge from garbled circuits and circuit-based composition of \(\Sigma \)-protocols
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
- 3-Message Zero Knowledge Against Human Ignorance
- Four-round black-box non-malleable schemes from one-way permutations
- The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
- Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits
- Efficient two-party exponentiation from quotient transfer
This page was built for publication: On the Power of Secure Two-Party Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829222)
