Secure and efficient delegation of elliptic-curve pairing

DOI10.1007/978-3-030-57808-4_3OpenAlexW3080912634MaRDI QIDQ2229264

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

Publication date: 23 February 2021

Full work available at URL: https://eprints.whiterose.ac.uk/159859/1/acns2020dkks_cameraready.pdf

zbMATH Keywords

elliptic curvescryptographypairingssecure delegation

Mathematics Subject Classification ID

Cryptography (94A60) Computer security (68M25)

Related Items (1)

A survey on delegated computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient and secure delegation to a single malicious server: exponentiation over non-abelian groups
• Efficient and secure delegation of exponentiation in general groups to a single malicious server
• Speeding up exponentiation using an untrusted computational resource
• Subgroup Security in Pairing-Based Cryptography
• Exponentiating in Pairing Groups
• Delegating Computation
• Secure Delegation of Elliptic-Curve Pairing
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
• Improved Delegation of Computation Using Fully Homomorphic Encryption
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• Optimal Pairings
• Delegating a Pairing Can Be Both Secure and Efficient
• Advances in Cryptology - EUROCRYPT 2004
• Server-Aided Verification: Theory and Practice
• Theory of Cryptography
• Advances in Cryptology - ASIACRYPT 2003

This page was built for publication: Secure and efficient delegation of elliptic-curve pairing