Oblivious-Transfer Amplification
From MaRDI portal
Recommendations
- Oblivious transfer and privacy amplification
- scientific article; zbMATH DE number 7650378
- Equivocable oblivious transfer
- On oblivious transfer capacity
- Oblivious Transfer from Weak Noisy Channels
- scientific article; zbMATH DE number 2080673
- Quantum Oblivious Transfer
- scientific article; zbMATH DE number 1303135
- Computationally secure oblivious transfer
- Laconic oblivious transfer and its applications
Cited in
(45)- Oblivious transfer in incomplete networks
- From attack on Feige-Shamir to construction of oblivious transfer
- Oblivious transfer and privacy amplification
- Everlasting multi-party computation
- Oblivious transfer is in MiniQCrypt
- Amplifying the security of functional encryption, unconditionally
- Channels of small log-ratio leakage and characterization of two-party differentially private computation
- Simultaneous amplification: the case of non-interactive zero-knowledge
- On the feasibility of extending oblivious transfer
- Network oblivious transfer
- Oblivious transfer from weakly random self-reducible public-key cryptosystem
- Secure two-party computation over a Z-channel
- Weak oblivious transfer from strong one-way functions
- Simultaneous secrecy and reliability amplification for a general channel model
- A note on a signature building block and relevant security reduction in the Green-Hohenberger OT scheme
- Cryptography with One-Way Communication
- An oblivious transfer scheme in Gaussian arithmetic
- Error-Tolerant Combiners for Oblivious Primitives
- Composable Security in the Bounded-Quantum-Storage Model
- A Framework for Efficient and Composable Oblivious Transfer
- Oblivious Transfer from Weak Noisy Channels
- How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?
- Reducing Complexity Assumptions for Oblivious Transfer
- Efficient oblivious transfer protocols achieving a non-zero rate from any non-trivial noisy correlation
- On the Reversibility of Oblivious Transfer
- scientific article; zbMATH DE number 1303135 (Why is no real title available?)
- scientific article; zbMATH DE number 1030984 (Why is no real title available?)
- scientific article; zbMATH DE number 2080673 (Why is no real title available?)
- On the feasibility of extending oblivious transfer
- On oblivious transfer capacity
- Computational two-party correlation: a dichotomy for key-agreement protocols
- OT-Combiners via Secure Computation
- Degradation and Amplification of Computational Hardness
- New Monotones and Lower Bounds in Unconditional Two-Party Computation
- Strong Conditional Oblivious Transfer and Computing on Intervals
- Security in Communication Networks
- Universally composable oblivious transfer based on a variant of LPN
- Statistical Security Conditions for Two-Party Secure Function Evaluation
- Oblivious Transfer Based on the McEliece Assumptions
- Oblivious Transfer and Linear Functions
- A tight computational indistinguishability bound for product distributions
- Amplification of non-interactive zero knowledge, revisited
- \textsf{LR-OT}: leakage-resilient oblivious transfer
- NIZK amplification via leakage-resilient secure computation
- Computationally differentially private inner-product protocols imply oblivious transfer
This page was built for publication: Oblivious-Transfer Amplification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5429412)
