Secure and efficient delegation of elliptic-curve pairing
From MaRDI portal
(Redirected from Publication:2229264)
Recommendations
Cites work
- scientific article; zbMATH DE number 1643939 (Why is no real title available?)
- scientific article; zbMATH DE number 1951619 (Why is no real title available?)
- scientific article; zbMATH DE number 2081084 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- Advances in Cryptology - EUROCRYPT 2004
- Certificateless public key cryptography
- Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
- Delegating a pairing can be both secure and efficient
- Delegating computation: interactive proofs for muggles
- Efficient and secure delegation of exponentiation in general groups to a single malicious server
- Efficient and secure delegation to a single malicious server: exponentiation over non-abelian groups
- Exponentiating in pairing groups
- Improved delegation of computation using fully homomorphic encryption
- Non-interactive verifiable computing: outsourcing computation to untrusted workers
- Optimal Pairings
- Secure delegation of elliptic-curve pairing
- Server-Aided Verification: Theory and Practice
- Speeding up exponentiation using an untrusted computational resource
- Subgroup security in pairing-based cryptography
- Theory of Cryptography
Cited in
(5)- Parallelizable delegation from LWE
- A survey on delegated computation
- scientific article; zbMATH DE number 1341872 (Why is no real title available?)
- scientific article; zbMATH DE number 1424190 (Why is no real title available?)
- Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting
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)