Cryptographic defense against traffic analysis
作者： Charles Rackoff , Daniel R. Simon
关键词: Traffic analysis 、 Distributed computing 、 Mathematics 、 Computer security 、 Cryptography
摘要:
acm.org
sci-hub.se 参考文章(23)
Daniel Ron Simon, On defining and achieving cryptographic security in a multiparty network On defining and achieving cryptographic security in a multiparty network. ,(1993)
Donald Ervin Knuth, The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information Addison-Wesley Longman Publishing Co., Inc.. ,(1978)
Manuel Blum, Shafi Goldwasser, An efficient probabilistic public key encryption scheme which hides all partial information international cryptology conference. pp. 289- 302 ,(1985) , 10.1007/3-540-39568-7_23
Donald Beaver, Foundations of Secure Interactive Computing international cryptology conference. pp. 377- 391 ,(1991) , 10.1007/3-540-46766-1_31
Andreas Pfitzmann, Michael Waidner, Birgit Pfitzmann, ISDN-MIXes: Untraceable Communication with Small Bandwidth Overhead kommunikation in verteilten systemen. pp. 451- 463 ,(1991)
Oded Goldreich, Hugo Krawczyk, On the Composition of Zero-Knowledge Proof Systems international colloquium on automata languages and programming. ,vol. 25, pp. 268- 282 ,(1990) , 10.1007/BFB0032038
M. Santha, U.V. Vazirani, Generating Quasi-Random Sequences From Slightly-Random Sources 25th Annual Symposium onFoundations of Computer Science, 1984.. pp. 434- 440 ,(1984) , 10.1109/SFCS.1984.715945
O. Goldreich, Towards a theory of software protection and simulation by oblivious RAMs symposium on the theory of computing. pp. 182- 194 ,(1987) , 10.1145/28395.28416
David Chaum, Achieving Electronic Privacy Scientific American. ,vol. 267, pp. 96- 101 ,(1992) , 10.1038/SCIENTIFICAMERICAN0892-96
O. Goldreich, S. Micali, A. Wigderson, How to play ANY mental game symposium on the theory of computing. pp. 218- 229 ,(1987) , 10.1145/28395.28420