Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions
From MaRDI portal
Publication:2223693
DOI10.1007/S00453-020-00750-2OpenAlexW3046807471MaRDI QIDQ2223693FDOQ2223693
Authors: Céline Chevalier, Fabien Laguillaumie, Damien Vergnaud 
Publication date: 1 February 2021
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-020-00750-2
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
Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Computer security (68M25) Privacy of data (68P27)
Cites Work
- Factoring polynomials with rational coefficients
- Short signatures from the Weil pairing
- Title not available (Why is that?)
- Title not available (Why is that?)
- A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
- Efficient signature generation by smart cards
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mathematics of public key cryptography.
- On Lovász' lattice reduction and the nearest lattice point problem
- Floating-Point LLL Revisited
- Easy scalar decompositions for efficient scalar multiplication on elliptic curves and genus 2 Jacobians
- Compact Proofs of Retrievability
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of certain multi-exponentiation techniques in cryptography
- New algorithms for secure outsourcing of modular exponentiations
- Secure delegation of elliptic-curve pairing
- Title not available (Why is that?)
- Theory of Cryptography
- Title not available (Why is that?)
- On Schnorr's preprocessing for digital signature schemes
- Finding a small root of a bivariate integer equation; factoring with high bits known
- Finding a small root of a univariate modular equation
- Secure outsourcing of modular exponentiations under single untrusted programme model
- Efficient and secure delegation of exponentiation in general groups to a single malicious server
- Delegating a pairing can be both secure and efficient
- Title not available (Why is that?)
Cited In (15)
- Revisiting single-server algorithms for outsourcing modular exponentiation
- Secure outsourcing of modular exponentiations under single untrusted programme model
- Speeding up exponentiation using an untrusted computational resource
- Hide the Modulus: A Secure Non-Interactive Fully Verifiable Delegation Scheme for Modular Exponentiations via CRT
- Efficient and secure delegation of exponentiation in general groups to a single malicious server
- Achieving privacy-preserving sensitive attributes for large universe based on private set intersection
- CRT-based outsourcing algorithms for modular exponentiations
- LOVE a pairing
- Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures
- Efficient and secure delegation to a single malicious server: exponentiation over non-abelian groups
- Theory of Cryptography
- A survey on delegated computation
- Title not available (Why is that?)
- Title not available (Why is that?)
- New algorithms for secure outsourcing of modular exponentiations
Uses Software
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)
