Founding Cryptography on Oblivious Transfer – Efficiently

DOI10.1007/978-3-540-85174-5_32zbMath1183.94037OpenAlexW1560201081WikidataQ29393432 ScholiaQ29393432MaRDI QIDQ3600241

Yuval Ishai, Manoj Prabhakaran, Amit Sahai

Publication date: 10 February 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-85174-5_32

Mathematics Subject Classification ID

Cryptography (94A60) Distributed systems (68M14) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (only showing first 100 items - show all)

One-way functions imply secure computation in a quantum world ⋮ Three-round secure multiparty computation from black-box two-round oblivious transfer ⋮ On the round complexity of black-box secure MPC ⋮ Fast cut-and-choose-based protocols for malicious and covert adversaries ⋮ Two-round MPC: information-theoretic and black-box ⋮ Round optimal black-box ``commit-and-prove ⋮ Oblivious transfer in incomplete networks ⋮ Secure computation using leaky correlations (asymptotically optimal constructions) ⋮ On the structure of unconditional UC hybrid protocols ⋮ Two attacks on rank metric code-based schemes: RankSign and an IBE scheme ⋮ Towards a unified approach to black-box constructions of zero-knowledge proofs ⋮ Binary AMD Circuits from Secure Multiparty Computation ⋮ Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity ⋮ Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions ⋮ Secure Multiparty RAM Computation in Constant Rounds ⋮ Constant-Round Maliciously Secure Two-Party Computation in the RAM Model ⋮ More Efficient Constant-Round Multi-party Computation from BMR and SHE ⋮ Cryptography with One-Way Communication ⋮ Round-Optimal Black-Box Two-Party Computation ⋮ Secure Computation from Leaky Correlated Randomness ⋮ Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits ⋮ Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting ⋮ Actively Secure OT Extension with Optimal Overhead ⋮ MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK) ⋮ Secure multiparty computation in the bounded storage model ⋮ An improved affine equivalence algorithm for random permutations ⋮ Secret Sharing Schemes with Algebraic Properties and Applications ⋮ Round-optimal and communication-efficient multiparty computation ⋮ Round-optimal black-box protocol compilers ⋮ Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols ⋮ Asymptotically quasi-optimal cryptography ⋮ Round-optimal multi-party computation with identifiable abort ⋮ Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) ⋮ Secure non-interactive reduction and spectral analysis of correlations ⋮ Algebraic geometric secret sharing schemes over large fields are asymptotically threshold ⋮ Feasibility and infeasibility of secure computation with malicious PUFs ⋮ A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement ⋮ On \(d\)-multiplicative secret sharing ⋮ More efficient oblivious transfer extensions ⋮ Secure two-party computation via cut-and-choose oblivious transfer ⋮ Generalizing Efficient Multiparty Computation ⋮ Reactive Garbling: Foundation, Instantiation, Application ⋮ Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys ⋮ (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens ⋮ Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) ⋮ Secure quantum computation with classical communication ⋮ On actively-secure elementary MPC reductions ⋮ Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions ⋮ Secure computation with low communication from cross-checking ⋮ Round-efficient black-box construction of composable multi-party computation ⋮ A note on ramp secret sharing schemes from error-correcting codes ⋮ Multi-party computation with conversion of secret sharing ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ All-but-many encryption ⋮ Efficient one-sided adaptively secure computation ⋮ Construction of arithmetic secret sharing schemes by using torsion limits ⋮ Everlasting multi-party computation ⋮ Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs ⋮ Computing boundary cycle of a pseudo-triangle polygon from its visibility graph ⋮ Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS ⋮ On the Computational Overhead of MPC with Dishonest Majority ⋮ Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model ⋮ Scalable Multi-party Private Set-Intersection ⋮ Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption ⋮ Constant-round maliciously secure two-party computation in the RAM model ⋮ Quantum cryptography ⋮ Yet another compiler for active security or: efficient MPC over arbitrary rings ⋮ From fairness to full security in multiparty computation ⋮ On the Complexity of Additively Homomorphic UC Commitments ⋮ On the exact round complexity of secure three-party computation ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ Efficient Secure Two-Party Exponentiation ⋮ High-performance multi-party computation for binary circuits based on oblivious transfer ⋮ On perfectly secure 2PC in the OT-hybrid model ⋮ On the power of secure two-party computation ⋮ Combiners for functional encryption, unconditionally ⋮ Going beyond dual execution: MPC for functions with efficient verification ⋮ Oblivious transfer is in MiniQCrypt ⋮ Generic compiler for publicly verifiable covert multi-party computation ⋮ Function secret sharing for mixed-mode and fixed-point secure computation ⋮ Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions ⋮ On Adaptively Secure Multiparty Computation with a Short CRS ⋮ Network Oblivious Transfer ⋮ On the Power of Secure Two-Party Computation ⋮ Secure Protocol Transformations ⋮ Rate-1, Linear Time and Additively Homomorphic UC Commitments ⋮ Probabilistic Termination and Composability of Cryptographic Protocols ⋮ On black-box complexity of universally composable security in the CRS model ⋮ Probabilistic termination and composability of cryptographic protocols ⋮ Efficient constant-round multi-party computation combining BMR and SPDZ ⋮ On Complete Primitives for Fairness ⋮ On the Necessary and Sufficient Assumptions for UC Computation ⋮ Founding Cryptography on Tamper-Proof Hardware Tokens ⋮ Efficient pseudorandom correlation generators from ring-LPN ⋮ Efficient constant-round MPC with identifiable abort and public verifiability ⋮ Black-box transformations from passive to covert security with public verifiability ⋮ Efficient and tight oblivious transfer from PKE with tight multi-user security ⋮ Non-interactive Secure 2PC in the Offline/Online and Batch Settings ⋮ Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model ⋮ The price of active security in cryptographic protocols

This page was built for publication: Founding Cryptography on Oblivious Transfer – Efficiently