Statistical Randomized Encodings: A Complexity Theoretic View-Reference-Cited by-同舟云学术

Statistical Randomized Encodings: A Complexity Theoretic View

Published:2015 Issue: Volume: Page:1-13
ISSN:0302-9743
Container-title:Automata, Languages, and Programming
language:
Short-container-title:

Author:

Agrawal Shweta,Ishai Yuval,Khurana Dakshita,Paskin-Cherniavsky Anat

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-47672-7_1

Reference19 articles.

1. Aiello, W., Håstad, J.: Relativized perfect zero knowledge is not BPP. Inf. Comput. (1991)

2. Applebaum, B.: Cryptography in Constant Parallel Time. Ph.D. thesis, Technion (2007)

3. Lecture Notes in Computer Science;B Applebaum,2011

4. Applebaum, B., Ishai, Y., Kushilevitz, E.: Computationally private randomizing polynomials and their applications. In: IEEE Conference on Computational Complexity, pp. 260–274. IEEE Computer Society (2005)

5. Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in NC0. SIAM J. Comput. 36(4), 845–888 (2006)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Power of Statistical Zero Knowledge;SIAM Journal on Computing;2019-10-22

2. On the Power of Secure Two-Party Computation;Journal of Cryptology;2019-02-07

3. On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings;computational complexity;2018-08-20

4. On the Power of Statistical Zero Knowledge;2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS);2017-10

5. On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings;Advances in Cryptology – CRYPTO 2016;2016