Efficient oblivious transfer protocols
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Two-round adaptively secure multiparty computation from standard assumptions
- Two-message statistically sender-private OT from LWE
- An improved affine equivalence algorithm for random permutations
- Laconic oblivious transfer and its applications
- How to simulate it in Isabelle: towards formal proof for secure multi-party computation
- Efficient k-out-of-n oblivious transfer scheme with the ideal communication cost
- Flexible quantum oblivious transfer
- Equational security proofs of oblivious transfer protocols
- Computationally secure oblivious transfer
- Oblivious keyword search
- A secure protocol for the oblivious transfer. (Extended abstract)
- What security can we achieve within 4 rounds?
- Oblivious DFA evaluation on joint input and its applications
- High-performance multi-party computation for binary circuits based on oblivious transfer
- Statistical ZAP arguments
- Statistical Zaps and new oblivious transfer protocols
- Witness indistinguishability for any single-round argument with applications to access control
- Non-interactive zero knowledge from sub-exponential DDH
- Compact, efficient and UC-secure isogeny-based oblivious transfer
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
- BETA: biometric-enabled threshold authentication
- Efficient and tight oblivious transfer from PKE with tight multi-user security
- Succinct non-interactive secure computation
- PSI from PaXoS: fast, malicious private set intersection
- Two-round oblivious transfer from CDH or LPN
- Three-round secure multiparty computation from black-box two-round oblivious transfer
- Highly efficient OT-based multiplication protocols
- Asymptotically quasi-optimal cryptography
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- Channels of small log-ratio leakage and characterization of two-party differentially private computation
- Secure two-party computation in a quantum world
- Secure linear system computation in the presence of malicious adversaries
- An efficient protocol for secure two-party computation in the presence of malicious adversaries
- More efficient oblivious transfer extensions
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers
- Cryptographic group actions and applications
- Rate-1 quantum fully homomorphic encryption
- Oblivious transfer from trapdoor permutations in minimal rounds
- Amortizing rate-1 OT and applications to PIR and PSI
- scientific article; zbMATH DE number 1583780 (Why is no real title available?)
- Efficient set intersection with simulation-based security
- Generic construction of UC-secure oblivious transfer
- Indistinguishability obfuscation: from approximate to exact
- Extending white-box cryptography based oblivious transfer protocol
- Accelerating oblivious transfer with batch multi-exponentiation
- What Security Can We Achieve Within 4 Rounds?
- Network oblivious transfer
- On the existence of extractable one-way functions
- Spooky Encryption and Its Applications
- Two-message, oblivious evaluation of cryptographic functionalities
- An efficient protocol for oblivious DFA evaluation and applications
- The simplest protocol for oblivious transfer
- Adaptive oblivious transfer and generalization
- Structure-preserving smooth projective hashing
- Weak oblivious transfer from strong one-way functions
- scientific article; zbMATH DE number 2127887 (Why is no real title available?)
- 3-message zero knowledge against human ignorance
- Standard security does not imply indistinguishability under selective opening
- Public-key encryption with simulation-based selective-opening security and compact ciphertexts
- scientific article; zbMATH DE number 4191075 (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?)
- Truly efficient string oblivious transfer using resettable tamper-proof tokens
- An oblivious transfer scheme in Gaussian arithmetic
- Improved Garbled Circuit: Free XOR Gates and Applications
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
- New Communication-Efficient Oblivious Transfer Protocols Based on Pairings
- Optimal Reductions Between Oblivious Transfers Using Interactive Hashing
- Oblivious Transfer Is Symmetric
- A Framework for Efficient and Composable Oblivious Transfer
- A New Secure Oblivious Transfer Protocol
- Oblivious Transfer Based on Key Exchange
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions
- Robust non-interactivet-out-of-noblivious transfer based on the RSA cryptosystem
- Smooth projective hashing and two-message oblivious transfer
- scientific article; zbMATH DE number 1030984 (Why is no real title available?)
- Communication-efficient distributed oblivious transfer
- scientific article; zbMATH DE number 1941258 (Why is no real title available?)
- Efficient Oblivious Transfer in the Bounded-Storage Model
- scientific article; zbMATH DE number 1952770 (Why is no real title available?)
- Efficient oblivious transfers with access control
- Randomized quantum oblivious transfer with application in hacker-resistant computation
- scientific article; zbMATH DE number 1842490 (Why is no real title available?)
- Efficient concurrent oblivious transfer in super-polynomial-simulation security
- Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
- Efficient oblivious transfer from lossy threshold homomorphic encryption
- Weak Zero-Knowledge beyond the Black-Box Barrier
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
- Information Security Practice and Experience
- Cut-and-choose bilateral oblivious transfer
- Smooth Projective Hashing and Two-Message Oblivious Transfer
- Blind Identity-Based Encryption and Simulatable Oblivious Transfer
- Efficient fully-simulatable oblivious transfer
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Cryptography and Game Theory: Designing Protocols for Exchanging Information
- OT-Combiners via Secure Computation
- Alternative Protocols for Generalized Oblivious Transfer
- Efficient Fully-Simulatable Oblivious Transfer
- Strong Conditional Oblivious Transfer and Computing on Intervals
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)
