Efficient and secure delegation of exponentiation in general groups to a single malicious server

DOI10.1007/S11786-020-00462-4MaRDI QIDQ2209264zbMATH OpenOpenAlexFDO

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

Publication date 30 October 2020

Published in Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL https://eprints.whiterose.ac.uk/156738/1/mics_imcs_jou_2_.pdf

zbMATH Keywords

cryptographygroup exponentiationgroup theorysecure delegatingsecure outsourcing

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Recommendations

• Efficient and secure delegation to a single malicious server: exponentiation over non-abelian groups
• 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
• Refereed delegation of computation

Cites work

• A practical cryptanalysis of \({\mathrm {walnutdsa}^{\mathrm {TM}}}\)
• Delegating a pairing can be both secure and efficient
• Designing programs that check their work
• Efficient and secure delegation to a single malicious server: exponentiation over non-abelian groups
• Efficient checkers for number-theoretic computations
• Fully homomorphic encryption using ideal lattices
• scientific article; zbMATH DE number 1588484 (Why is no real title available?)
• scientific article; zbMATH DE number 1618063 (Why is no real title available?)
• scientific article; zbMATH DE number 1303125 (Why is no real title available?)
• scientific article; zbMATH DE number 1303126 (Why is no real title available?)
• Improved delegation of computation using fully homomorphic encryption
• New algorithms for secure outsourcing of modular exponentiations
• Non-interactive verifiable computing: outsourcing computation to untrusted workers
• Secure delegation of elliptic-curve pairing
• Secure outsourcing of modular exponentiations under single untrusted programme model
• Self-testing/correcting with applications to numerical problems
• Server-Aided Verification: Theory and Practice
• Speeding up exponentiation using an untrusted computational resource
• The hidden subgroup problem and post-quantum group-based cryptography
• The status of polycyclic group-based cryptography: a survey and open problems
• Theory of Cryptography

Cited in

(9)

• Efficient and secure delegation to a single malicious server: exponentiation over non-abelian groups
• Delegating a product of group exponentiations with application to signature schemes
• White-box ECDSA: challenges and existing solutions
• A survey on delegated computation
• Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions
• Secure and efficient delegation of elliptic-curve pairing
• Speeding up exponentiation using an untrusted computational resource
• Hide the Modulus: A Secure Non-Interactive Fully Verifiable Delegation Scheme for Modular Exponentiations via CRT
• DeCSIDH: delegating isogeny computations in the CSIDH setting

This page was built for publication: Efficient and secure delegation of exponentiation in general groups to a single malicious server

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