Speeding up exponentiation using an untrusted computational resource

DOI10.1007/S10623-005-3710-8zbMATH Open1144.94385OpenAlexW2052572664MaRDI QIDQ2491304FDOQ2491304

Authors: Marten van Dijk, Dwaine Clarke, Blaise Gassend, G. Edward Suh, Srinivas Devadas 

Publication date: 29 May 2006

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-005-3710-8

Recommendations

• Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions
• Delegating a product of group exponentiations with application to signature schemes
• Efficient and secure delegation of exponentiation in general groups to a single malicious server
• New algorithms for secure outsourcing of modular exponentiations
• scientific article; zbMATH DE number 1024100

zbMATH Keywords

exponentiationsignature verificationuntrusted computation

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• A method for obtaining digital signatures and public-key cryptosystems
• Title not available (Why is that?)
• Cryptanalysis of short RSA secret exponents
• Monte Carlo Methods for Index Computation (mod p)
• Title not available (Why is that?)
• Cryptanalysis of RSA with private key d less than N/sup 0.292/
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• Advances in Cryptology - CRYPTO 2003
• Efficient signature generation by smart cards
• Title not available (Why is that?)
• Title not available (Why is that?)
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Title not available (Why is that?)
• Designing programs that check their work
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast evaluation of logarithms in fields of characteristic two
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Theory of Cryptography
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Discrete logarithms: The past and the future
• Title not available (Why is that?)
• On the Security of the Schnorr Scheme using Preprocessing
• On Schnorr's preprocessing for digital signature schemes
• Cryptanalysis of `less short' RSA secret exponents
• Public Key Cryptography – PKC 2004
• Title not available (Why is that?)
• High-bandwidth encryption with low-bandwidth smartcards
• On the security of remotely keyed encryption
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (9)

• How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields
• Yao's millionaires' problem and public-key encryption without computational assumptions
• Secure outsourcing of modular exponentiations under single untrusted programme model
• Delegating a product of group exponentiations with application to signature schemes
• Efficient and secure delegation of exponentiation in general groups to a single malicious server
• CRT-based outsourcing algorithms for modular exponentiations
• Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures
• A survey on delegated computation
• Secure and efficient delegation of elliptic-curve pairing

This page was built for publication: Speeding up exponentiation using an untrusted computational resource

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