Efficient Secure Two-Party Exponentiation

DOI10.1007/978-3-642-19074-2_2zbMath1284.94149OpenAlexW2113761519MaRDI QIDQ3073692

Sherman S. M. Chow, Ching-Hua Yu, Feng-Hao Liu, Kai-Min Chung

Publication date: 11 February 2011

Published in: Topics in Cryptology – CT-RSA 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19074-2_2

zbMATH Keywords

additive/multiplicative sharetwo-party exponentiation

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items

Amortizing division and exponentiation

Cites Work

• Unnamed Item
• Unnamed Item
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• Efficient, Robust and Constant-Round Distributed RSA Key Generation
• Fully Homomorphic Encryption over the Integers
• Founding Cryptography on Oblivious Transfer – Efficiently
• Secure Arithmetic Computation with No Honest Majority
• Secure Multiparty Computation Goes Live
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Fully homomorphic encryption using ideal lattices
• Theory of Cryptography
• Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
• Theory of Cryptography
• Public Key Cryptography - PKC 2006
• Privacy preserving data mining