Verifiable Computation for Randomized Algorithm

DOI10.1007/978-3-319-49890-4_6zbMath1411.94073OpenAlexW2553898375MaRDI QIDQ3179479

Rui Xue, Muhua Liu, Ying Wu

Publication date: 21 December 2016

Published in: Progress in Cryptology – INDOCRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-49890-4_6

zbMATH Keywords

randomized algorithmsverifiable computationindistinguishability obfuscation

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• On the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption
• Delegatable Homomorphic Encryption with Applications to Secure Outsourcing of Computation
• How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
• Constrained Verifiable Random Functions
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
• Improved Delegation of Computation Using Fully Homomorphic Encryption
• From Secrecy to Soundness: Efficient Verification via Secure Computation
• Signatures of Correct Computation
• Multi-Client Non-interactive Verifiable Computation
• Verifiable Delegation of Computation over Large Datasets
• Multi-Client Verifiable Computation with Stronger Security Guarantees
• Functional Encryption for Randomized Functionalities
• Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions
• Functional Signatures and Pseudorandom Functions
• Multi-input Functional Encryption

This page was built for publication: Verifiable Computation for Randomized Algorithm