A survey on delegated computation

DOI10.1007/978-3-031-05578-2_3MaRDI QIDQ2163976zbMATH OpenOpenAlexFDO

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

Publication date 11 August 2022

Full work available at URL https://doi.org/10.1007/978-3-031-05578-2_3

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A note on probabilistically verifying integer and polynomial products
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• Delegating a pairing can be both secure and efficient
• Delegating a product of group exponentiations with application to signature schemes
• Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
• Designing programs that check their work
• Efficient and secure delegation of exponentiation in general groups to a single malicious server
• Exponentiating in pairing groups
• Faster integer multiplication
• Genus 2 hyperelliptic curve families with explicit Jacobian order evaluation and pairing-friendly constructions
• Hide the Modulus: A Secure Non-Interactive Fully Verifiable Delegation Scheme for Modular Exponentiations via CRT
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• scientific article; zbMATH DE number 1643939 (Why is no real title available?)
• scientific article; zbMATH DE number 4195192 (Why is no real title available?)
• scientific article; zbMATH DE number 3952653 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• scientific article; zbMATH DE number 1842494 (Why is no real title available?)
• scientific article; zbMATH DE number 2206373 (Why is no real title available?)
• New algorithms for secure outsourcing of modular exponentiations
• New directions in cryptography
• On hiding information from an oracle
• On one method for fast approximation of zeta constants by rational fractions
• Optimal Pairings
• Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions
• Secure and efficient delegation of elliptic-curve pairing
• Secure delegation of elliptic-curve pairing
• Self-testing/correcting with applications to numerical problems
• Server-Aided Verification: Theory and Practice
• Software reliability via run-time result-checking
• Speeding up exponentiation using an untrusted computational resource
• Subgroup security in pairing-based cryptography
• The Knowledge Complexity of Interactive Proof Systems
• Theory of Cryptography

Cited in

(1)

• Succinct delegation for low-space non-deterministic computation

This page was built for publication: A survey on delegated computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2163976)