Fully-Simulatable Oblivious Set Transfer
From MaRDI portal
Recommendations
- Efficient Fully-Simulatable Oblivious Transfer
- Efficient fully-simulatable oblivious transfer
- Generic fully simulatable adaptive oblivious transfer
- Simulatable Adaptive Oblivious Transfer
- Efficient concurrent oblivious transfer in super-polynomial-simulation security
- Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- Equivocable oblivious transfer
Cites work
- scientific article; zbMATH DE number 1618044 (Why is no real title available?)
- scientific article; zbMATH DE number 1722674 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- Blind Identity-Based Encryption and Simulatable Oblivious Transfer
- Computational Sample Complexity
- Computationally secure oblivious transfer
- Efficient fully-simulatable oblivious transfer
- How to construct constant-round zero-knowledge proof systems for NP
- Lower bounds for sampling algorithms for estimating the average
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Simulatable Adaptive Oblivious Transfer
Cited in
(3)
This page was built for publication: Fully-Simulatable Oblivious Set Transfer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511158)