Author:
Bresson Emmanuel,Catalano Dario,Pointcheval David
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Benaloh, J.: Verifiable Secret-Ballot Elections. PhD Thesis, Yale University (1987)
2. Lecture Notes in Computer Science;D. Boneh,1998
3. Boyar, J.F., Kurtz, S.A., Krentel, M.W.: A Discrete Logarithm Implementation of Perfect Zero-Knowledge Blobs. Journal of Cryptology 2(2), 63–76 (1990)
4. Brassard, G., Chaum, D., Crépeau, C.: Minimum Disclosure Proofs of Knowledge. Journal of Computer and System Sciences 37 (1988)
5. Catalano, D., Gennaro, R., Howgrave-Graham, N., Nguyen, P.Q.: Paillier’s Cryptosystem Revisited. In: Proc. of the 8th CCS, pp. 206–214. ACM Press, New York (2001)
Cited by
130 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献