A proof of security of Yao's protocol for two-party computation
From MaRDI portal
Publication:1015361
DOI10.1007/s00145-008-9036-8zbMath1159.94364OpenAlexW2106217851MaRDI QIDQ1015361
Publication date: 8 May 2009
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-008-9036-8
Related Items (80)
Three halves make a whole? Beating the half-gates lower bound for garbled circuits ⋮ Efficient set intersection with simulation-based security ⋮ An Efficient Protocol for Oblivious DFA Evaluation and Applications ⋮ Limits on the adaptive security of Yao's garbling ⋮ Fast cut-and-choose-based protocols for malicious and covert adversaries ⋮ A simple construction of iO for Turing machines ⋮ Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ Practical attacks against the walnut digital signature scheme ⋮ Privacy-Preserving Extraction of HOG Features Based on Integer Vector Homomorphic Encryption ⋮ One-Time Programs with Limited Memory ⋮ Garbling XOR gates ``for free in the standard model ⋮ Adaptive Security of Yao’s Garbled Circuits ⋮ Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting ⋮ Single-Key to Multi-Key Functional Encryption with Polynomial Loss ⋮ Rate-limited secure function evaluation ⋮ Adaptive security of practical garbling schemes ⋮ An improved affine equivalence algorithm for random permutations ⋮ Anonymous IBE, leakage resilience and circular security from new assumptions ⋮ Secure multi-party computation protocol for sequencing problem ⋮ Enforcing input correctness via certification in garbled circuit evaluation ⋮ Garbled circuits with sublinear evaluator ⋮ Round-optimal and communication-efficient multiparty computation ⋮ Making Private Function Evaluation Safer, Faster, and Simpler ⋮ Feasibility and infeasibility of secure computation with malicious PUFs ⋮ Fast garbling of circuits under standard assumptions ⋮ Secure two-party computation via cut-and-choose oblivious transfer ⋮ Secure Two-Party Computation: A Visual Way ⋮ How to simulate it in Isabelle: towards formal proof for secure multi-party computation ⋮ Efficient and scalable universal circuits ⋮ Secure collaborative supply chain planning and inverse optimization -- the JELS model ⋮ Statistical security in two-party computation revisited ⋮ SCALES. MPC with small clients and larger ephemeral servers ⋮ Triply adaptive UC NIZK ⋮ Privacy-preserving naive Bayes classifiers secure against the substitution-then-comparison attack ⋮ Two-round adaptively secure MPC from isogenies, LPN, or CDH ⋮ How to build a trapdoor function from an encryption scheme ⋮ Breaking and fixing garbled circuits when a gate has duplicate input wires ⋮ Constant-round adaptive zero-knowledge proofs for NP ⋮ Tri-state circuits. A circuit model that captures RAM ⋮ Quantum solution to a class of two-party private summation problems ⋮ Privacy-preserving outsourcing of image feature extraction in cloud computing ⋮ Improved Garbled Circuit: Free XOR Gates and Applications ⋮ Two-round maliciously secure computation with super-polynomial simulation ⋮ On treewidth, separators and Yao's garbling ⋮ Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free ⋮ Secure two-party computation in a quantum world ⋮ Secure Top-k Subgroup Discovery ⋮ Secure Multi-party Computation: Information Flow of Outputs and Game Theory ⋮ Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations ⋮ Efficient one-sided adaptively secure computation ⋮ Secure computation without computers ⋮ Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption ⋮ Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model ⋮ Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation ⋮ On the Exact Round Complexity of Self-composable Two-Party Computation ⋮ Constant-round maliciously secure two-party computation in the RAM model ⋮ Security against covert adversaries: Efficient protocols for realistic adversaries ⋮ Oblivious DFA evaluation on joint input and its applications ⋮ A Practical Universal Circuit Construction and Secure Evaluation of Private Functions ⋮ Cryptography and Game Theory: Designing Protocols for Exchanging Information ⋮ Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness ⋮ Obfustopia built on secret-key functional encryption ⋮ Dispelling myths on superposition attacks: formal security model and attack analyses ⋮ Adaptively Secure Two-Party Computation with Erasures ⋮ On perfectly secure 2PC in the OT-hybrid model ⋮ On perfectly secure 2PC in the OT-hybrid model ⋮ Low cost constant round MPC combining BMR and oblivious transfer ⋮ Probability timed automata for investigating communication processes ⋮ On the power of secure two-party computation ⋮ Going beyond dual execution: MPC for functions with efficient verification ⋮ Threshold garbled circuits and ad hoc secure computation ⋮ High-Precision Secure Computation of Satellite Collision Probabilities ⋮ On the Power of Secure Two-Party Computation ⋮ Adaptively Secure Garbled Circuits from One-Way Functions ⋮ TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption ⋮ Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA ⋮ An efficient protocol for secure two-party computation in the presence of malicious adversaries ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer ⋮ The Complexity of Differential Privacy ⋮ Hashing Garbled Circuits for Free
Cites Work
This page was built for publication: A proof of security of Yao's protocol for two-party computation
