A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
From MaRDI portal
Publication:2175906
DOI10.1007/978-3-030-36030-6_5zbMath1455.94154OpenAlexW2991062243MaRDI QIDQ2175906
Daniele Venturi, Daniele Friolo, Daniel Masny
Publication date: 30 April 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-36030-6_5
Related Items (11)
On the round complexity of black-box secure MPC ⋮ Round-optimal and communication-efficient multiparty computation ⋮ Round-optimal black-box protocol compilers ⋮ A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement ⋮ Round-optimal oblivious transfer and MPC from computational CSIDH ⋮ Knowledge encryption and its applications to simulatable protocols with low round-complexity ⋮ Two-round adaptively secure MPC from isogenies, LPN, or CDH ⋮ Round-optimal black-box MPC in the plain model ⋮ Reusable secure computation in the plain model ⋮ Oblivious transfer from trapdoor permutations in minimal rounds ⋮ Minicrypt primitives with algebraic structure and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the round complexity of OT extension
- Probabilistic encryption
- Certifying trapdoor permutations, revisited
- Two-message statistically sender-private OT from LWE
- Two-round multiparty secure computation from minimal assumptions
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
- A new approach to round-optimal secure multiparty computation
- Four round secure computation without setup
- Round-optimal secure two-party computation from trapdoor permutations
- Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds
- A generic approach to constructing and proving verifiable random functions
- Computationally secure oblivious transfer
- Promise zero knowledge and its applications to round optimal MPC
- Round optimal secure multiparty computation from minimal assumptions
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- Enhancements of trapdoor permutations
- On the feasibility of extending oblivious transfer
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- Efficient Non-interactive Secure Computation
- Black-Box Constructions of Protocols for Secure Computation
- The Group of Signed Quadratic Residues and Applications
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
- Round-Optimal Black-Box Two-Party Computation
- A Framework for Efficient and Composable Oblivious Transfer
- Founding Cryptography on Oblivious Transfer – Efficiently
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- On the Feasibility of Extending Oblivious Transfer
- Certifying RSA
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Smooth Projective Hashing and Two-Message Oblivious Transfer
- Blind Identity-Based Encryption and Simulatable Oblivious Transfer
- Efficient Two-Party Secure Computation on Committed Inputs
- Simulatable Adaptive Oblivious Transfer
- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
- The Exact Round Complexity of Secure Computation
- On lattices, learning with errors, random linear codes, and cryptography
- Round-optimal secure multi-party computation
This page was built for publication: A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
