Speeding up exponentiation using an untrusted computational resource

DOI10.1007/S10623-005-3710-8MaRDI QIDQ2491304zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

exponentiationsignature verificationuntrusted computation

Mathematics Subject Classification ID

Cryptography (94A60)

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

Cites work

• scientific article; zbMATH DE number 1583766 (Why is no real title available?)
• scientific article; zbMATH DE number 1583952 (Why is no real title available?)
• scientific article; zbMATH DE number 1676634 (Why is no real title available?)
• scientific article; zbMATH DE number 4191111 (Why is no real title available?)
• scientific article; zbMATH DE number 3825707 (Why is no real title available?)
• scientific article; zbMATH DE number 1302807 (Why is no real title available?)
• scientific article; zbMATH DE number 1303125 (Why is no real title available?)
• scientific article; zbMATH DE number 1303127 (Why is no real title available?)
• scientific article; zbMATH DE number 503335 (Why is no real title available?)
• scientific article; zbMATH DE number 503339 (Why is no real title available?)
• scientific article; zbMATH DE number 682387 (Why is no real title available?)
• scientific article; zbMATH DE number 1024017 (Why is no real title available?)
• scientific article; zbMATH DE number 1024052 (Why is no real title available?)
• scientific article; zbMATH DE number 1024100 (Why is no real title available?)
• scientific article; zbMATH DE number 1030981 (Why is no real title available?)
• scientific article; zbMATH DE number 1030982 (Why is no real title available?)
• scientific article; zbMATH DE number 1088932 (Why is no real title available?)
• scientific article; zbMATH DE number 1113850 (Why is no real title available?)
• scientific article; zbMATH DE number 2009964 (Why is no real title available?)
• scientific article; zbMATH DE number 2081056 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• scientific article; zbMATH DE number 1406771 (Why is no real title available?)
• scientific article; zbMATH DE number 1418248 (Why is no real title available?)
• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Advances in Cryptology - CRYPTO 2003
• Cryptanalysis of RSA with private key d less than N/sup 0.292/
• Cryptanalysis of `less short' RSA secret exponents
• Cryptanalysis of short RSA secret exponents
• Designing programs that check their work
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• Discrete logarithms: The past and the future
• Efficient signature generation by smart cards
• Fast evaluation of logarithms in fields of characteristic two
• High-bandwidth encryption with low-bandwidth smartcards
• Monte Carlo Methods for Index Computation (mod p)
• On Schnorr's preprocessing for digital signature schemes
• On the Security of the Schnorr Scheme using Preprocessing
• On the security of remotely keyed encryption
• Public Key Cryptography – PKC 2004
• Theory of Cryptography

Cited in

(9)

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

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)