Batching base oblivious transfers
From MaRDI portal
Publication:6157552
Recommendations
Cites work
- scientific article; zbMATH DE number 1617924 (Why is no real title available?)
- scientific article; zbMATH DE number 1808282 (Why is no real title available?)
- scientific article; zbMATH DE number 1256767 (Why is no real title available?)
- scientific article; zbMATH DE number 697813 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- A public-key encryption scheme with pseudo-random ciphertexts
- Actively secure 1-out-of-\(N\) OT extension with application to private set intersection
- Actively secure OT extension with optimal overhead
- Advances in Cryptology - CRYPTO 2003
- BLAKE2: simpler, smaller, fast as MD5
- Blazing fast OT for three-round UC OT extension
- Efficient hashing using the AES instruction set
- Efficient indifferentiable hashing into ordinary elliptic curves
- Efficient oblivious transfer protocols
- Improved OT extension for transferring short secrets
- Improved elliptic curve hashing and point representation
- Indifferentiability of iterated Even-Mansour ciphers with non-idealized key-schedules: five rounds are necessary and sufficient
- Indifferentiable deterministic hashing to elliptic and hyperelliptic curves
- One-way permutations on elliptic curves
- Public Key Cryptography - PKC 2006
- Public Key Cryptography - PKC 2006
- The Arithmetic of Elliptic Curves
- The design of Rijndael. The Advanced Encryption Standard (AES)
- The simplest protocol for oblivious transfer
Cited in
(4)
This page was built for publication: Batching base oblivious transfers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157552)