A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
From MaRDI portal
Publication:2175906
Recommendations
Cites work
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- A Framework for Efficient and Composable Oblivious Transfer
- A generic approach to constructing and proving verifiable random functions
- A new approach to round-optimal secure multiparty computation
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Black-box constructions of protocols for secure computation
- Blind Identity-Based Encryption and Simulatable Oblivious Transfer
- Certifying RSA
- Certifying trapdoor permutations, revisited
- Computationally secure oblivious transfer
- Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds
- Efficient fully-simulatable oblivious transfer
- Efficient non-interactive secure computation
- Efficient oblivious transfer protocols
- Efficient Two-Party Secure Computation on Committed Inputs
- Enhancements of trapdoor permutations
- Founding Cryptography on Oblivious Transfer – Efficiently
- Four round secure computation without setup
- scientific article; zbMATH DE number 1722674 (Why is no real title available?)
- scientific article; zbMATH DE number 3856987 (Why is no real title available?)
- scientific article; zbMATH DE number 708823 (Why is no real title available?)
- scientific article; zbMATH DE number 1759794 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- On lattices, learning with errors, random linear codes, and cryptography
- On the feasibility of extending oblivious transfer
- On the feasibility of extending oblivious transfer
- On the round complexity of OT extension
- Probabilistic encryption
- Promise zero knowledge and its applications to round optimal MPC
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
- Round optimal secure multiparty computation from minimal assumptions
- Round-optimal black-box two-party computation
- Round-optimal secure multi-party computation
- Round-optimal secure two-party computation from trapdoor permutations
- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
- Simulatable Adaptive Oblivious Transfer
- Smooth Projective Hashing and Two-Message Oblivious Transfer
- The Exact Round Complexity of Secure Computation
- The Group of Signed Quadratic Residues and Applications
- Two-message statistically sender-private OT from LWE
- Two-round multiparty secure computation from minimal assumptions
Cited in
(18)- 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
- Oblivious transfer from trapdoor permutations in minimal rounds
- Round-Optimal Black-Box Statistically Binding Selective-Opening Secure Commitments
- Fully-Simulatable Oblivious Set Transfer
- Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols
- Minicrypt primitives with algebraic structure and applications
- 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
- Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model
- From privacy-only to simulatable OT: black-box, round-optimal, information-theoretic
- On the relationship between public key primitives via indifferentiability
- Round-optimal compiler for semi-honest to malicious oblivious transfer via CIH
This page was built for publication: A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175906)
