<--- Back to Details
First PageDocument Content
Computational complexity theory / Cryptography / Complexity classes / Theory of computation / NP / IP / Advice / PP / P / Soundness / Commitment scheme / Certificate
Date: 2018-05-13 02:26:15
Computational complexity theory
Cryptography
Complexity classes
Theory of computation
NP
IP
Advice
PP
P
Soundness
Commitment scheme
Certificate

Monotone Batch NP-Delegation with Applications to Access Control Zvika Brakerski∗ Yael Tauman Kalai†

Add to Reading List

Source URL: eprint.iacr.org

Download Document from Source Website

File Size: 465,39 KB

Share Document on Facebook

Similar Documents

ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

DocID: 1rsiG - View Document

Locally Random Reductions: Improvements and Applications  D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995

Locally Random Reductions: Improvements and Applications  D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995

DocID: 1raDV - View Document

ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

DocID: 1rauh - View Document

A Commitment-Consistent Proof of a Shuffle Douglas Wikstr¨om CSC KTH Stockholm, Sweden   Abstract. We introduce a pre-computation technique that drastically

A Commitment-Consistent Proof of a Shuffle Douglas Wikstr¨om CSC KTH Stockholm, Sweden Abstract. We introduce a pre-computation technique that drastically

DocID: 1r7EK - View Document

ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

DocID: 1qUxu - View Document