CRT-based outsourcing algorithms for modular exponentiations

DOI10.1007/978-3-319-49890-4_5MaRDI QIDQ3179478zbMATH OpenOpenAlexFDO

Authors Lakshmi Kuppusamy, Jothi Rangasamy

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)

Recommendations

• New algorithms for secure outsourcing of modular exponentiations
• Theory of Cryptography
• Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions
• Secure outsourcing of modular exponentiations under single untrusted programme model
• Revisiting single-server algorithms for outsourcing modular exponentiation

Cites work

• Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
• Efficient signature generation by smart cards
• Financial Cryptography
• Fully homomorphic encryption using ideal lattices
• scientific article; zbMATH DE number 1617943 (Why is no real title available?)
• scientific article; zbMATH DE number 4191111 (Why is no real title available?)
• scientific article; zbMATH DE number 1303125 (Why is no real title available?)
• scientific article; zbMATH DE number 2081056 (Why is no real title available?)
• scientific article; zbMATH DE number 1759793 (Why is no real title available?)
• New algorithms for secure outsourcing of modular exponentiations
• Non-interactive verifiable computing: outsourcing computation to untrusted workers
• On hiding information from an oracle
• On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
• On the Final Exponentiation in Tate Pairing Computations
• Secure delegation of elliptic-curve pairing
• Server-Aided Verification Signatures: Definitions and New Constructions
• Server-Aided Verification: Theory and Practice
• Speeding up exponentiation using an untrusted computational resource
• The Weil pairing, and its efficient calculation
• Theory of Cryptography

Cited in

(10)

• Revisiting single-server algorithms for outsourcing modular exponentiation
• How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields
• Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures
• Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents
• Secure outsourcing of modular exponentiations under single untrusted programme model
• New algorithms for secure outsourcing of modular exponentiations
• Non-interactive and verifiable outsourcing computation scheme for modular exponentiation
• Efficient algorithms for secure outsourcing of bilinear pairings
• Theory of Cryptography
• Hide the Modulus: A Secure Non-Interactive Fully Verifiable Delegation Scheme for Modular Exponentiations via CRT

This page was built for publication: CRT-based outsourcing algorithms for modular exponentiations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179478)