Efficient oblivious transfer protocols
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Oblivious transfer from trapdoor permutations in minimal rounds
- Constrained pseudorandom functions from homomorphic secret sharing
- scientific article; zbMATH DE number 4191075 (Why is no real title available?)
- Lossy cryptography from code-based assumptions
- More efficient oblivious transfer extensions
- Cryptographic group actions and applications
- Secure two-party computation in a quantum world
- Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
- \textsf{LR-OT}: leakage-resilient oblivious transfer
- Improved Garbled Circuit: Free XOR Gates and Applications
- Efficient k-out-of-n oblivious transfer scheme with the ideal communication cost
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- Oblivious Transfer Is Symmetric
- On the existence of extractable one-way functions
- A New Secure Oblivious Transfer Protocol
- Oblivious Transfer Based on Key Exchange
- Robust non-interactivet-out-of-noblivious transfer based on the RSA cryptosystem
- Indistinguishability obfuscation: from approximate to exact
- Oblivious keyword search
- Lossy cryptography from code-based assumptions dense-sparse LPN: a new subexponentially hard LPN variant in SZK
- Accelerating oblivious transfer with batch multi-exponentiation
- Two-message, oblivious evaluation of cryptographic functionalities
- Efficient fully-simulatable oblivious transfer
- Standard security does not imply indistinguishability under selective opening
- Public-key encryption with simulation-based selective-opening security and compact ciphertexts
- Weak oblivious transfer from strong one-way functions
- A Framework for Efficient and Composable Oblivious Transfer
- Laconic oblivious transfer and its applications
- Statistical security in two-party computation revisited
- Equational security proofs of oblivious transfer protocols
- Generic construction of UC-secure oblivious transfer
- Threshold fully homomorphic encryption over the torus
- Adaptive oblivious transfer and generalization
- The simplest protocol for oblivious transfer
- 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
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)
