Speeding up exponentiation using an untrusted computational resource
From MaRDI portal
Publication:2491304
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
- Secure acceleration of DSS signatures using insecure server
Cites work
- A formal treatment of remotely keyed encryption. (Extended abstract)
- A method for obtaining digital signatures and public-key cryptosystems
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A subexponential algorithm for discrete logarithms over all finite fields
- Accelerated remotely keyed encryption
- Advances in Cryptology - CRYPTO 2003
- Cryptanalysis of `less short' RSA secret exponents
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Cryptanalysis of short RSA secret exponents
- Cryptanalysis of the RSA schemes with short secret exponent from Asiacrypt '99
- Designing programs that check their work
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
- Discrete logarithms: The effectiveness of the index calculus method
- Discrete logarithms: The past and the future
- Efficient exponentiation using precomputation and vector addition chains
- Efficient signature generation by smart cards
- Fast evaluation of logarithms in fields of characteristic two
- Fast server-aided RSA signatures secure against active attacks
- Generating RSA keys on a handheld using an untrusted server
- High-bandwidth encryption with low-bandwidth smartcards
- 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 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 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?)
- Monte Carlo Methods for Index Computation (mod p)
- More flexible exponentiation with precomputation
- On Schnorr's preprocessing for digital signature schemes
- On the security of remotely keyed encryption
- On the Security of the Schnorr Scheme using Preprocessing
- On verifiable implicit asking protocols for RSA computation
- Public Key Cryptography – PKC 2004
- Secure acceleration of DSS signatures using insecure server
- Security and performance of server-aided RSA computation protocols
- Speeding up discrete log and factoring based schemes via precomputations
- The Béguin-Quisquater server-aided RSA protocol from Crypto '95 is not secure
- Theory of Cryptography
Cited in
(9)- How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields
- Delegating a product of group exponentiations with application to signature schemes
- Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures
- A survey on delegated computation
- Efficient and secure delegation of exponentiation in general groups to a single malicious server
- Secure and efficient delegation of elliptic-curve pairing
- Secure outsourcing of modular exponentiations under single untrusted programme model
- CRT-based outsourcing algorithms for modular exponentiations
- Yao's millionaires' problem and public-key encryption without computational assumptions
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)
