Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions
From MaRDI portal
Publication:2223693
Recommendations
- Revisiting single-server algorithms for outsourcing modular exponentiation
- Secure outsourcing of modular exponentiations under single untrusted programme model
- Practically efficient secure distributed exponentiation without bit-decomposition
- Non-interactive and verifiable outsourcing computation scheme for modular exponentiation
- New algorithms for secure outsourcing of modular exponentiations
- Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures
- Efficient and secure delegation of exponentiation in general groups to a single malicious server
- Secure multiplication of shared secrets in the exponent
Cites work
- scientific article; zbMATH DE number 1303120 (Why is no real title available?)
- scientific article; zbMATH DE number 1303125 (Why is no real title available?)
- scientific article; zbMATH DE number 503339 (Why is no real title available?)
- scientific article; zbMATH DE number 1088932 (Why is no real title available?)
- scientific article; zbMATH DE number 1182510 (Why is no real title available?)
- scientific article; zbMATH DE number 2081084 (Why is no real title available?)
- scientific article; zbMATH DE number 2085203 (Why is no real title available?)
- scientific article; zbMATH DE number 1842492 (Why is no real title available?)
- scientific article; zbMATH DE number 1406771 (Why is no real title available?)
- A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
- Compact Proofs of Retrievability
- Delegating a pairing can be both secure and efficient
- Easy scalar decompositions for efficient scalar multiplication on elliptic curves and genus 2 Jacobians
- Efficient and secure delegation of exponentiation in general groups to a single malicious server
- Efficient signature generation by smart cards
- Factoring polynomials with rational coefficients
- Finding a small root of a bivariate integer equation; factoring with high bits known
- Finding a small root of a univariate modular equation
- Floating-Point LLL Revisited
- Mathematics of public key cryptography.
- New algorithms for secure outsourcing of modular exponentiations
- On Lovász' lattice reduction and the nearest lattice point problem
- On Schnorr's preprocessing for digital signature schemes
- Secure delegation of elliptic-curve pairing
- Secure outsourcing of modular exponentiations under single untrusted programme model
- Short signatures from the Weil pairing
- The complexity of certain multi-exponentiation techniques in cryptography
- Theory of Cryptography
Cited in
(15)- 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
- Theory of Cryptography
- Efficient and secure delegation to a single malicious server: exponentiation over non-abelian groups
- Speeding up exponentiation using an untrusted computational resource
- LOVE a pairing
- scientific article; zbMATH DE number 1618063 (Why is no real title available?)
- Achieving privacy-preserving sensitive attributes for large universe based on private set intersection
- Secure outsourcing of modular exponentiations under single untrusted programme model
- scientific article; zbMATH DE number 2158222 (Why is no real title available?)
- New algorithms for secure outsourcing of modular exponentiations
- Hide the Modulus: A Secure Non-Interactive Fully Verifiable Delegation Scheme for Modular Exponentiations via CRT
- CRT-based outsourcing algorithms for modular exponentiations
- Revisiting single-server algorithms for outsourcing modular exponentiation
This page was built for publication: Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2223693)
