Sub-linear zero-knowledge argument for correctness of a shuffle
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Toward practical and unconditional verification of remote computations
HotOS'13 Proceedings of the 13th USENIX conference on Hot topics in operating systems
Practical verified computation with streaming interactive proofs
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Verifiable computation with massively parallel interactive proofs
HotCloud'12 Proceedings of the 4th USENIX conference on Hot Topics in Cloud Ccomputing
Taking proof-based verified computation a few steps closer to practicality
Security'12 Proceedings of the 21st USENIX conference on Security symposium
Succinct non-interactive arguments via linear interactive proofs
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Resolving the conflict between generality and plausibility in verified computation
Proceedings of the 8th ACM European Conference on Computer Systems
Delegation of computation with verification outsourcing: curious verifiers
Proceedings of the 2013 ACM symposium on Principles of distributed computing
On the concrete efficiency of probabilistically-checkable proofs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
ACM SIGOPS 24th Symposium on Operating Systems Principles
Verifying computations with state
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
Verifying the correctness of remote executions: from wild implausibility to near practicality
Proceedings of the 9th Workshop on Hot Topics in Dependable Systems
| Hi-index | 0.00 |
There exists a positive constant \alpha \le 1 such that for any function T(n)\leqslant n^{\alpha} and for any problem L \in BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time which decides L, except for at most a 2^{-\Omega ...