Efficient oblivious transfer protocols
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Flexible quantum oblivious transfer
- Classically verifiable NIZK for QMA with preprocessing
- Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions
- Succinct non-interactive secure computation
- SecGDB: graph encryption for exact shortest distance queries with efficient updates
- New Communication-Efficient Oblivious Transfer Protocols Based on Pairings
- Efficient Oblivious Transfer in the Bounded-Storage Model
- Efficient concurrent oblivious transfer in super-polynomial-simulation security
- Knowledge encryption and its applications to simulatable protocols with low round-complexity
- Reverse firewalls for oblivious transfer extension and applications to zero-knowledge
- Weak zero-knowledge via the Goldreich-Levin theorem
- Three-round secure multiparty computation from black-box two-round oblivious transfer
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
- Efficient set intersection with simulation-based security
- Secure linear system computation in the presence of malicious adversaries
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
- Information Security Practice and Experience
- An improved affine equivalence algorithm for random permutations
- Round-optimal black-box secure computation from two-round malicious OT
- Smooth projective hashing and two-message oblivious transfer
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Smooth Projective Hashing and Two-Message Oblivious Transfer
- What security can we achieve within 4 rounds?
- Cut-and-choose bilateral oblivious transfer
- Two-round adaptively secure multiparty computation from standard assumptions
- Two-message statistically sender-private OT from LWE
- scientific article; zbMATH DE number 1842490 (Why is no real title available?)
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- Oblivious Transfer Based on the McEliece Assumptions
- scientific article; zbMATH DE number 1583780 (Why is no real title available?)
- scientific article; zbMATH DE number 4191102 (Why is no real title available?)
- scientific article; zbMATH DE number 3856987 (Why is no real title available?)
- Network oblivious transfer
- Structure-preserving smooth projective hashing
- Oblivious DFA evaluation on joint input and its applications
- An efficient protocol for secure two-party computation in the presence of malicious adversaries
- Alternative Protocols for Generalized Oblivious Transfer
- Communication-efficient distributed oblivious transfer
- Efficient Traceable Oblivious Transfer and Its Applications
- Witness indistinguishability for any single-round argument with applications to access control
- Truly efficient string oblivious transfer using resettable tamper-proof tokens
- Efficient oblivious transfers with access control
- Blind Identity-Based Encryption and Simulatable Oblivious Transfer
- OT-Combiners via Secure Computation
- A new framework for quantum oblivious transfer
- Actively secure arithmetic computation and VOLE with constant computational overhead
- What Security Can We Achieve Within 4 Rounds?
- Optimal Reductions Between Oblivious Transfers Using Interactive Hashing
- Almost optimal oblivious transfer from QA-NIZK
- Faster Privacy-Preserving Location Proximity Schemes
- Two-round adaptively secure MPC from isogenies, LPN, or CDH
- Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model
- Verifiable homomorphic oblivious transfer and private equality test
- A framework for statistically sender private OT with optimal rate
- List oblivious transfer and applications to round-optimal black-box multiparty coin tossing
- Reusable secure computation in the plain model
- Round-optimal black-box MPC in the plain model
- Algebraic restriction codes and their applications
- Cryptography and Game Theory: Designing Protocols for Exchanging Information
- scientific article; zbMATH DE number 2127887 (Why is no real title available?)
- scientific article; zbMATH DE number 1952770 (Why is no real title available?)
- High-performance multi-party computation for binary circuits based on oblivious transfer
- Solutions to the anti-piracy problem in oblivious transfer
- Extending white-box cryptography based oblivious transfer protocol
- Statistically sender-private OT from LPN and derandomization
- Spooky Encryption and Its Applications
- Efficient and tight oblivious transfer from PKE with tight multi-user security
- Randomized quantum oblivious transfer with application in hacker-resistant computation
- 3-message zero knowledge against human ignorance
- Efficient oblivious transfer from lossy threshold homomorphic encryption
- Improved private set intersection against malicious adversaries
- Asymptotically quasi-optimal cryptography
- Highly efficient OT-based multiplication protocols
- Batching base oblivious transfers
- Statistical ZAP arguments
- Statistical Zaps and new oblivious transfer protocols
- Compact, efficient and UC-secure isogeny-based oblivious transfer
- Non-interactive zero knowledge from sub-exponential DDH
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
- Adaptive oblivious transfer with access control from lattice assumptions
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
- PSI from PaXoS: fast, malicious private set intersection
- Two-round oblivious transfer from CDH or LPN
- Two-round maliciously-secure oblivious transfer with optimal rate
- Channels of small log-ratio leakage and characterization of two-party differentially private computation
- Fair coin flipping: tighter analysis and the many-party case
- BETA: biometric-enabled threshold authentication
- An oblivious transfer scheme in Gaussian arithmetic
- Computationally secure oblivious transfer
- Efficient Fully-Simulatable Oblivious Transfer
- scientific article; zbMATH DE number 1941258 (Why is no real title available?)
- An efficient protocol for oblivious DFA evaluation and applications
- Weak Zero-Knowledge beyond the Black-Box Barrier
- Strong Conditional Oblivious Transfer and Computing on Intervals
- ``The simplest protocol for oblivious transfer revisited
- How to simulate it in Isabelle: towards formal proof for secure multi-party computation
- Rate-1 quantum fully homomorphic encryption
- Round-optimal black-box multiparty computation from polynomial-time assumptions
- Amortizing rate-1 OT and applications to PIR and PSI
This page was built for publication: Efficient oblivious transfer protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768332)
