Computationally secure oblivious transfer
From MaRDI portal
Recommendations
Cited in
(26)- Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions
- New Communication-Efficient Oblivious Transfer Protocols Based on Pairings
- Oblivious-Transfer Amplification
- Security of blind signatures under aborts and applications to adaptive oblivious transfer
- Optimal forgeries against polynomial-based MACs and GCM
- Secure computation using leaky correlations (asymptotically optimal constructions)
- Information Security
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- Theory of Cryptography
- Generalized oblivious transfer by secret sharing
- Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
- Efficient Traceable Oblivious Transfer and Its Applications
- Round Optimal Universally Composable Oblivious Transfer Protocols
- scientific article; zbMATH DE number 1418318 (Why is no real title available?)
- Efficient oblivious transfers with access control
- Fully-Simulatable Oblivious Set Transfer
- Secure multi-party computation of Boolean circuits with applications to privacy in on-line marketplaces
- scientific article; zbMATH DE number 2085428 (Why is no real title available?)
- scientific article; zbMATH DE number 1952770 (Why is no real title available?)
- Local differential privacy protocol for making key-value data robust against poisoning attacks
- Statistical ZAPR arguments from bilinear maps
- Adaptive oblivious transfer with access control from lattice assumptions
- Quantum-Resistant 1-out-of-N Oblivious Signatures from Lattices
- Oblivious Transfer Is Symmetric
- Accelerating oblivious transfer with batch multi-exponentiation
- Adaptive oblivious transfer and generalization
This page was built for publication: Computationally secure oblivious transfer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1777283)