Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Ben-Or, M., Goldwasser, S., Widgerson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proc. of STOC (1988)
2. Boudot, F., Schoenmakers, B., Traore, J.: A fair and efficient solution to the socialist millionaires’ problem. Discrete Applied Mathematics 111, 77–85 (2001)
3. Camenisch, J.: Proof systems for general statements about discrete logarithms. Technical Report 260, Dept. of Computer Science, ETH Zurich (March 1997)
4. Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM 24, 84–88 (1981)
5. Lecture Notes in Computer Science;D. Chaum,1987
Cited by
237 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献