Rational arguments: single round delegation with sublinear verification
DOI10.1145/2554797.2554845zbMATH Open1364.68199OpenAlexW2089421253MaRDI QIDQ2988906FDOQ2988906
Authors: Siyao Guo, Pavel Hubáček, Alon Rosen, Margarita Vald 
Publication date: 19 May 2017
Published in: Proceedings of the 5th conference on Innovations in theoretical computer science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2554797.2554845
Recommendations
Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Network protocols (68M12)
Cites Work
- A hierarchy of polynomial time lattice basis reduction algorithms
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Evaluating Branching Programs on Encrypted Data
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- On lattices, learning with errors, random linear codes, and cryptography
- Trapdoors for hard lattices and new cryptographic constructions
- Title not available (Why is that?)
- (Leveled) fully homomorphic encryption without bootstrapping
- On lattices, learning with errors, random linear codes, and cryptography
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Bounds for Width Two Branching Programs
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
- New lattice-based cryptographic constructions
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Toward basing fully homomorphic encryption on worst-case hardness
Cited In (13)
- Title not available (Why is that?)
- Structural complexity of rational interactive proofs
- Efficient Probabilistically Checkable Debates
- Rational delegation computing protocol based on rational trust model
- Verifiable crowd computing: coping with bounded rationality
- Rational proofs with multiple provers
- Sumcheck-based delegation of quantum computing to rational server
- Fair and rational delegation computation protocol
- Outsourcing computation: the minimal refereed mechanism
- Automata, Languages and Programming
- Rational sumchecks
- Verifiable crowd computing: coping with bounded rationality
- Perfectly secure message transmission against independent rational adversaries
This page was built for publication: Rational arguments: single round delegation with sublinear verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988906)
