Efficient and secure delegation to a single malicious server: exponentiation over non-abelian groups

DOI10.1007/978-3-319-96418-8_17MaRDI QIDQ1662220zbMATH OpenOpenAlexFDO

Authors Giovanni Di Crescenzo, Delaram Kahrobaei, Matluba Khodjaeva, Vladimir Shpilrain

Publication date 17 August 2018

Full work available at URL https://doi.org/10.1007/978-3-319-96418-8_17

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Efficient and secure delegation of exponentiation in general groups to a single malicious server
• Delegating a product of group exponentiations with application to signature schemes
• Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions
• Hide the Modulus: A Secure Non-Interactive Fully Verifiable Delegation Scheme for Modular Exponentiations via CRT
• Revisiting single-server algorithms for outsourcing modular exponentiation

Cited in

(4)

• 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
• Secure and efficient delegation of elliptic-curve pairing
• Some applications of arithmetic groups in cryptography

This page was built for publication: Efficient and secure delegation to a single malicious server: exponentiation over non-abelian groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662220)