Accelerating oblivious transfer with batch multi-exponentiation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1722674 (Why is no real title available?)
- scientific article; zbMATH DE number 2085428 (Why is no real title available?)
- scientific article; zbMATH DE number 4191102 (Why is no real title available?)
- scientific article; zbMATH DE number 3856987 (Why is no real title available?)
- scientific article; zbMATH DE number 4213912 (Why is no real title available?)
- scientific article; zbMATH DE number 1303126 (Why is no real title available?)
- scientific article; zbMATH DE number 503243 (Why is no real title available?)
- scientific article; zbMATH DE number 503339 (Why is no real title available?)
- scientific article; zbMATH DE number 1030985 (Why is no real title available?)
- scientific article; zbMATH DE number 1088932 (Why is no real title available?)
- scientific article; zbMATH DE number 2080695 (Why is no real title available?)
- scientific article; zbMATH DE number 1472274 (Why is no real title available?)
- scientific article; zbMATH DE number 1406771 (Why is no real title available?)
- scientific article; zbMATH DE number 1418318 (Why is no real title available?)
- A Survey of Fast Exponentiation Methods
- A public key cryptosystem and a signature scheme based on discrete logarithms
- An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques
- Batch verification of short signatures
- Computing Sequences with Addition Chains
- Efficient oblivious transfer protocols
- Fast modular multi-exponentiation using modified complex arithmetic
- Improved batch exponentiation
- Modular Multiplication Without Trial Division
- Multi-exponentiation (cryptographic protocols)
- New modular multiplication algorithms for fast modular exponentiation
- Oblivious keyword search
- On the Evaluation of Powers and Monomials
- Practical Short Signature Batch Verification
- Public Key Cryptography - PKC 2005
- Reducibility and Completeness in Private Computations
Cited in
(2)
This page was built for publication: Accelerating oblivious transfer with batch multi-exponentiation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817471)