Secure and efficient delegation of elliptic-curve pairing
From MaRDI portal
Publication:2229264
DOI10.1007/978-3-030-57808-4_3OpenAlexW3080912634MaRDI QIDQ2229264FDOQ2229264
Authors: Giovanni Di Crescenzo, Matluba Khodjaeva, Delaram Kahrobaei, Vladimir Shpilrain
Publication date: 23 February 2021
Full work available at URL: https://eprints.whiterose.ac.uk/159859/1/acns2020dkks_cameraready.pdf
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Advances in Cryptology - EUROCRYPT 2004
- Certificateless public key cryptography
- Title not available (Why is that?)
- Optimal Pairings
- Non-interactive verifiable computing: outsourcing computation to untrusted workers
- Improved delegation of computation using fully homomorphic encryption
- Server-Aided Verification: Theory and Practice
- Secure delegation of elliptic-curve pairing
- Theory of Cryptography
- Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
- Delegating computation: interactive proofs for muggles
- Efficient and secure delegation to a single malicious server: exponentiation over non-abelian groups
- Exponentiating in pairing groups
- Subgroup security in pairing-based cryptography
- Speeding up exponentiation using an untrusted computational resource
- Efficient and secure delegation of exponentiation in general groups to a single malicious server
- Delegating a pairing can be both secure and efficient
Cited In (5)
This page was built for publication: Secure and efficient delegation of elliptic-curve pairing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229264)