Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions

DOI10.1007/s00453-020-00750-2OpenAlexW3046807471MaRDI QIDQ2223693

Fabien Laguillaumie, Damien Vergnaud, Céline Chevalier

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

zbMATH Keywords

cryptanalysisprotocolsoptimality resultsCoppersmith methodssecure outsource computation

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Computer security (68M25) Privacy of data (68P27)

Related Items (2)

A survey on delegated computation ⋮ Achieving privacy-preserving sensitive attributes for large universe based on private set intersection

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Schnorr's preprocessing for digital signature schemes
• On Lovász' lattice reduction and the nearest lattice point problem
• Factoring polynomials with rational coefficients
• Efficient signature generation by smart cards
• Short signatures from the Weil pairing
• Efficient and secure delegation of exponentiation in general groups to a single malicious server
• Secure outsourcing of modular exponentiations under single untrusted programme model
• The complexity of certain multi-exponentiation techniques in cryptography
• Easy scalar decompositions for efficient scalar multiplication on elliptic curves and genus 2 Jacobians
• New Algorithms for Secure Outsourcing of Modular Exponentiations
• Finding a Small Root of a Univariate Modular Equation
• Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
• Mathematics of Public Key Cryptography
• Secure Delegation of Elliptic-Curve Pairing
• Compact Proofs of Retrievability
• Delegating a Pairing Can Be Both Secure and Efficient
• Floating-Point LLL Revisited
• A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
• Theory of Cryptography

This page was built for publication: Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions