Batching base oblivious transfers
From MaRDI portal
Publication:6157552
DOI10.1007/978-3-030-92078-4_10zbMATH Open1514.94119OpenAlexW4243877129MaRDI QIDQ6157552FDOQ6157552
Authors: Ian McQuoid, Mike Rosulek, Lawrence Roy
Publication date: 12 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-92078-4_10
Recommendations
Cites Work
- The Arithmetic of Elliptic Curves
- Efficient oblivious transfer protocols
- Title not available (Why is that?)
- Public Key Cryptography - PKC 2006
- Advances in Cryptology - CRYPTO 2003
- Title not available (Why is that?)
- One-way permutations on elliptic curves
- Title not available (Why is that?)
- A public-key encryption scheme with pseudo-random ciphertexts
- Public Key Cryptography - PKC 2006
- Indifferentiable deterministic hashing to elliptic and hyperelliptic curves
- Efficient hashing using the AES instruction set
- Efficient indifferentiable hashing into ordinary elliptic curves
- Improved elliptic curve hashing and point representation
- The design of Rijndael. The Advanced Encryption Standard (AES)
- The simplest protocol for oblivious transfer
- Title not available (Why is that?)
- BLAKE2: simpler, smaller, fast as MD5
- Improved OT extension for transferring short secrets
- Title not available (Why is that?)
- Actively secure OT extension with optimal overhead
- Indifferentiability of iterated Even-Mansour ciphers with non-idealized key-schedules: five rounds are necessary and sufficient
- Blazing fast OT for three-round UC OT extension
- Actively secure 1-out-of-\(N\) OT extension with application to private set intersection
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)