Delegating a pairing can be both secure and efficient
From MaRDI portal
Publication:5168565
DOI10.1007/978-3-319-07536-5_32zbMATH Open1404.94047OpenAlexW9326323MaRDI QIDQ5168565FDOQ5168565
Authors: Sébastien Canard, Julien Devigne, Olivier Sanders
Publication date: 7 July 2014
Published in: Applied Cryptography and Network Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-07536-5_32
Recommendations
Cited In (11)
- Batch Pairing Delegation
- Efficient and secure delegation of exponentiation in general groups to a single malicious server
- Title not available (Why is that?)
- LOVE a pairing
- A survey on delegated computation
- Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions
- Secure and efficient delegation of elliptic-curve pairing
- Efficient round-optimal blind signatures in the standard model
- Efficient algorithms for secure outsourcing of bilinear pairings
- On the implementation of a pairing-based cryptographic protocol in a constrained device
- Secure delegation of elliptic-curve pairing
This page was built for publication: Delegating a pairing can be both secure and efficient
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5168565)