Practical adaptive oblivious transfer from simple assumptions
From MaRDI portal
Publication:3000548
DOI10.1007/978-3-642-19571-6_21zbMATH Open1295.94076OpenAlexW1605668542MaRDI QIDQ3000548FDOQ3000548
Author name not available (Why is that?)
Publication date: 19 May 2011
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19571-6_21
Recommendations
Cited In (18)
- Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys
- NIWI and new notions of extraction for algebraic languages
- Generic Fully Simulatable Adaptive Oblivious Transfer
- Tagged One-Time Signatures: Tight Security and Optimal Tag Size
- Zero-knowledge systems from MPC-in-the-head and oblivious transfer
- Tightly secure signatures and public-key encryption
- Efficient and round-optimal oblivious transfer and commitment with adaptive security
- Simulatable Adaptive Oblivious Transfer
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Title not available (Why is that?)
- Adaptive oblivious transfer with access control from lattice assumptions
- Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
- ``The simplest protocol for oblivious transfer revisited
- Title not available (Why is that?)
- Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
- The Feasibility of Outsourced Database Search in the Plain Model
- Universally Composable Adaptive Oblivious Transfer
This page was built for publication: Practical adaptive oblivious transfer from simple assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000548)
