Accelerating Oblivious Transfer with Batch Multi-exponentiation

DOI10.1007/978-3-319-40253-6_19zbMath1409.94906OpenAlexW2482208433MaRDI QIDQ2817471

Jingwen Liu, Qianhong Wu, Yang Sun, Bo Qin, Wei Hu, Xin-Yi Huang, Jian-wei Liu

Publication date: 31 August 2016

Published in: Information Security and Privacy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40253-6_19

zbMATH Keywords

modular exponentiationbatch multi-exponentiationbatch oblivious transfer

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12)

Cites Work

• An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques
• Fast modular multi-exponentiation using modified complex arithmetic
• Improved batch exponentiation
• Oblivious keyword search
• Batch verification of short signatures
• New Modular Multiplication Algorithms for Fast Modular Exponentiation
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• Modular Multiplication Without Trial Division
• Practical Short Signature Batch Verification
• On the Evaluation of Powers and Monomials
• Computing Sequences with Addition Chains
• A Survey of Fast Exponentiation Methods
• Multi-exponentiation (cryptographic protocols)
• Reducibility and Completeness in Private Computations
• Public Key Cryptography - PKC 2005
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Accelerating Oblivious Transfer with Batch Multi-exponentiation