Efficient Fully-Simulatable Oblivious Transfer
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1722674 (Why is no real title available?)
- scientific article; zbMATH DE number 176562 (Why is no real title available?)
- scientific article; zbMATH DE number 503243 (Why is no real title available?)
- scientific article; zbMATH DE number 2086698 (Why is no real title available?)
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Blind Identity-Based Encryption and Simulatable Oblivious Transfer
- Efficient oblivious transfer protocols
- Foundations of Cryptography
- How to construct constant-round zero-knowledge proof systems for NP
- Pairings for cryptographers
- Probability and Computing
- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
- Security and composition of multiparty cryptographic protocols
- Simulatable Adaptive Oblivious Transfer
- Smooth Projective Hashing and Two-Message Oblivious Transfer
- Strict Polynomial-Time in Simulation and Extraction
Cited in
(23)- Classically verifiable NIZK for QMA with preprocessing
- Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions
- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
- Efficient adaptive oblivious transfer without q-type assumptions in UC framework
- Efficient concurrent oblivious transfer in super-polynomial-simulation security
- Knowledge encryption and its applications to simulatable protocols with low round-complexity
- Smooth Projective Hashing and Two-Message Oblivious Transfer
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- Round Optimal Universally Composable Oblivious Transfer Protocols
- Blind Identity-Based Encryption and Simulatable Oblivious Transfer
- Fully-Simulatable Oblivious Set Transfer
- Efficiency-improved fully simulatable adaptive OT under the DDH assumption
- Solutions to the anti-piracy problem in oblivious transfer
- Compact, efficient and UC-secure isogeny-based oblivious transfer
- Adaptive oblivious transfer with access control from lattice assumptions
- Efficient oblivious transfer protocols
- ``The simplest protocol for oblivious transfer revisited
- Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols
- Privacy-enhanced attribute-based private information retrieval
- Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
- Efficient k-out-of-n oblivious transfer scheme with the ideal communication cost
- Efficient fully-simulatable oblivious transfer
- Universally Composable Adaptive Oblivious Transfer
This page was built for publication: Efficient Fully-Simulatable Oblivious Transfer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458932)
