A survey on delegated computation
From MaRDI portal
Publication:2163976
DOI10.1007/978-3-031-05578-2_3OpenAlexW4285266227MaRDI QIDQ2163976
Delaram Kahrobaei, Giovanni Di Crescenzo, Vladimir Shpilrain, Matluba Khodjaeva
Publication date: 11 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-05578-2_3
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On hiding information from an oracle
- Self-testing/correcting with applications to numerical problems
- Delegating a product of group exponentiations with application to signature schemes
- Efficient and secure delegation of exponentiation in general groups to a single malicious server
- Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions
- Secure and efficient delegation of elliptic-curve pairing
- On one method for fast approximation of zeta constants by rational fractions
- Speeding up exponentiation using an untrusted computational resource
- New Algorithms for Secure Outsourcing of Modular Exponentiations
- Subgroup Security in Pairing-Based Cryptography
- Exponentiating in Pairing Groups
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- A note on probabilistically verifying integer and polynomial products
- Secure Delegation of Elliptic-Curve Pairing
- Faster Integer Multiplication
- Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
- A public key cryptosystem and a signature scheme based on discrete logarithms
- The Knowledge Complexity of Interactive Proof Systems
- New directions in cryptography
- Software reliability via run-time result-checking
- Designing programs that check their work
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions
- Optimal Pairings
- Delegating a Pairing Can Be Both Secure and Efficient
- Server-Aided Verification: Theory and Practice
- Theory of Cryptography
- Hide the Modulus: A Secure Non-Interactive Fully Verifiable Delegation Scheme for Modular Exponentiations via CRT
This page was built for publication: A survey on delegated computation
