CRT-Based Outsourcing Algorithms for Modular Exponentiations

DOI10.1007/978-3-319-49890-4_5zbMath1411.94072OpenAlexW2551253694MaRDI QIDQ3179478

Jothi Rangasamy, Lakshmi Kuppusamy

Publication date: 21 December 2016

Published in: Progress in Cryptology – INDOCRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-49890-4_5

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Hide the Modulus: A Secure Non-Interactive Fully Verifiable Delegation Scheme for Modular Exponentiations via CRT ⋮ Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient signature generation by smart cards
• On hiding information from an oracle
• The Weil pairing, and its efficient calculation
• Speeding up exponentiation using an untrusted computational resource
• New Algorithms for Secure Outsourcing of Modular Exponentiations
• On the Final Exponentiation in Tate Pairing Computations
• On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
• Secure Delegation of Elliptic-Curve Pairing
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
• Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
• Financial Cryptography
• Fully homomorphic encryption using ideal lattices
• Server-Aided Verification: Theory and Practice
• Server-Aided Verification Signatures: Definitions and New Constructions
• Theory of Cryptography

This page was built for publication: CRT-Based Outsourcing Algorithms for Modular Exponentiations