Author:
Fauzi Prastudy,Lipmaa Helger,Zając Michał
Publisher
Springer Berlin Heidelberg
Reference39 articles.
1. Lecture Notes in Computer Science;M Ambrona,2016
2. Lecture Notes in Computer Science;DF Aranha,2014
3. Lecture Notes in Computer Science;G Barthe,2015
4. Lecture Notes in Computer Science;M Bellare,1998
5. Bitansky, N., Canetti, R., Paneth, O., Rosen, A.: On the existence of extractable one-way functions. In: STOC 2014, pp. 505–514 (2014)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Subversion-Resistant SNARKs;Journal of Cryptology;2021-04-28
2. A Novel Proof of Shuffle: Exponentially Secure Cut-and-Choose;Information Security and Privacy;2021
3. More Efficient Shuffle Argument from Unique Factorization;Topics in Cryptology – CT-RSA 2021;2021
4. SoK: Techniques for Verifiable Mix Nets;2020 IEEE 33rd Computer Security Foundations Symposium (CSF);2020-06
5. How not to prove your election outcome;2020 IEEE Symposium on Security and Privacy (SP);2020-05