Author:
Kohlweiss Markulf,Faust Sebastian,Fritsch Lothar,Gedrojc Bartek,Preneel Bart
Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Asokan, N., Schunter, M., Waidner, M.: Optimistic protocols for fair exchange. In: CCS 1997. Proceedings of the 4th ACM conference on Computer and communications security, pp. 7–17. ACM Press, New York, NY, USA (1997)
2. Asokan, N., Shoup, V., Waidner, M.: Asynchronous protocols for optimistic fair exchange. sp 00, 0086 (1998)
3. Bangerter, E., Camenisch, J., Maurer, U.M.: Efficient proofs of knowledge of discrete logarithms and representations in groups with hidden order. In: Hutter and Ullmann [17], pp. 154–171
4. Beresford, A.R., Stajano, F.: Location Privacy in Pervasive Computing. IEEE Pervasive Computing 2(1), 46–55 (2003)
5. Lecture Notes in Computer Science;S. Brands,1997
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献