Simulatable adaptive oblivious transfer with statistical receiver's privacy
From MaRDI portal
Recommendations
Cites work
- A generalisation, a simplification and some applications of Paillier's probabilistic public-key system
- A verifiable random function with short proofs and keys
- Blind Identity-Based Encryption and Simulatable Oblivious Transfer
- Efficiency-improved fully simulatable adaptive OT under the DDH assumption
- Efficient k-out-of-n oblivious transfer schemes with adaptive and non-adaptive queries
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Efficient signature generation by smart cards
- Efficient zero-knowledge proofs of knowledge without intractability assumptions
- Evaluating 2-DNF formulas on ciphertexts
- Evaluating Branching Programs on Encrypted Data
- Generic fully simulatable adaptive oblivious transfer
- How to Shuffle in Public
- scientific article; zbMATH DE number 708820 (Why is no real title available?)
- scientific article; zbMATH DE number 1775399 (Why is no real title available?)
- Information Security
- Oblivious transfer with adaptive queries
- Secure Vickrey auctions without threshold trust
- Short group signatures
- Simple adaptive oblivious transfer without random oracle
- Simulatable Adaptive Oblivious Transfer
- Universally Composable Adaptive Oblivious Transfer
- Universally Composable Adaptive Priced Oblivious Transfer
Cited in
(5)
This page was built for publication: Simulatable adaptive oblivious transfer with statistical receiver's privacy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3092348)