Cryptographic defense against traffic analysis

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Cryptographic defense against traffic analysis

Full text

Pdf (1.10 MB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing table of contents

San Diego, California, United States

Pages: 672 - 681

Year of Publication: 1993

ISBN:0-89791-591-7

Authors

Charles Rackoff
Daniel R. Simon

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 39, Citation Count: 16

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/167088.167260 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	B	Donald Beaver, Foundations of Secure Interactive Computing, Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology, p.377-391, August 11-15, 1991
	BFM	Manuel Blum , Paul Feldman , Silvio Micali, Non-interactive zero-knowledge and its applications, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.103-112, May 02-04, 1988, Chicago, Illinois, United States [doi>10.1145/62212.62222]
	BG	Manuel Blum , Shafi Goldwasser, An efficient probabilistic public key encryption scheme which hides all partial information, Proceedings of CRYPTO 84 on Advances in cryptology, p.289-302, August 1985, Santa Barbara, California, United States
	BMR	D. Beaver , S. Micali , P. Rogaway, The round complexity of secure protocols, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.503-513, May 13-17, 1990, Baltimore, Maryland, United States [doi>10.1145/100216.100287]
	Ch1	David L. Chaum, Untraceable electronic mail, return addresses, and digital pseudonyms, Communications of the ACM, v.24 n.2, p.84-90, Feb. 1981 [doi>10.1145/358549.358563]
	Ch2	D. Chaum, The dining cryptographers problem: unconditional sender and recipient untraceability, Journal of Cryptology, v.1 n.1, p.65-75, 1988
	Ch3	D. Chaum, Achieving Electronic Privacy, Scientific American, vol. 267, no. 2 (1992), pp. 96-101.
	DDN	Danny Dolev , Cynthia Dwork , Moni Naor, Non-malleable cryptography, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.542-552, May 05-08, 1991, New Orleans, Louisiana, United States [doi>10.1145/103418.103474]
	Go	O. Goldreich, Towards a theory of software protection and simulation by oblivious RAMs, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.182-194, January 1987, New York, New York, United States [doi>10.1145/28395.28416]
	GK	Oded Goldreich , Hugo Krawczyk, On the composition of zero-knowledge proof systems, Proceedings of the seventeenth international colloquium on Automata, languages and programming, p.268-282, July 1990, Warwick University, England
	GMRa	S Goldwasser , S Micali , C Rackoff, The knowledge complexity of interactive proof-systems, Proceedings of the seventeenth annual ACM symposium on Theory of computing, p.291-304, May 06-08, 1985, Providence, Rhode Island, United States [doi>10.1145/22145.22178]
	GMW	O. Goldreich , S. Micali , A. Wigderson, How to play ANY mental game, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.218-229, January 1987, New York, New York, United States [doi>10.1145/28395.28420]
	K	Donald Ervin Knuth, The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1978
	Mi	M. Mihail, Conductance and Convergence of Markov Chains: A Combinatorial Treatment of Expanders, Proc. 30th IEEE Symposium on Foundations of Computer Science (1989), pp. 526-531.
	MR	S. Micali and P. Rogaway, Secure Computation# Advances in Cryptology: Proc. CRYPTO '91.
	Os	R. Ostrovsky, Efficient computation on oblivious RAMs, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.514-523, May 13-17, 1990, Baltimore, Maryland, United States [doi>10.1145/100216.100289]
	P	A. Pfitzmann, How to Implement ISDNs Without User Observability#Some Remarks, TR 14/85, Fakult#t fiir Informatik, Universit#t Karlsruhe, 1985.
	PPW	Andreas Pfitzmann , Birgit Pfitzmann , Michael Waidner, ISDN-MIXes: Untraceable Communication with Small Bandwidth Overhead, Kommunikation in Verteilten Systemen, Grundlagen, Anwendungen, Betrieb, GI/ITG-Fachtagung, p.451-463, February 20-22, 1991
	Sh	Adi Shamir, How to share a secret, Communications of the ACM, v.22 n.11, p.612-613, Nov. 1979 [doi>10.1145/359168.359176]
	Si	Daniel Ron Simon, On defining and achieving cryptographic security in a multiparty network, University of Toronto, Toronto, Ont., Canada, 1993
	SJ	Alistair Sinclair , Mark Jerrum, Approximate counting, uniform generation and rapidly mixing Markov chains, Information and Computation, v.82 n.1, p.93-133, July 1989 [doi>10.1016/0890-5401(89)90067-9]
	SV	M. Santha and U.V. Vazirani, Generating Quasi-Random Sequences from Slightly- Random Sources, Proc. 25th ACM Symp. on Theory of Computing (1984), pp. 434-440.
	VV	U.V. Vazirani and V.V. Vazirani, Random Polynomial Time is Equal to Slightly-Random Polynomial Time, Proc. 26th IEEE Symp. on Foundations of Computer Science (1985), pp. 417-428.
	Y	A.C. Yao, How to Generate and Exchange Secrets, Proc. 27th IEEE Symp. on Foundations of Computer Science (1986), pp. 162-167.

CITED BY 16

	Brenda Timmerman, A security model for dynamic adaptive traffic masking, Proceedings of the 1997 workshop on New security paradigms, p.107-116, September 23-26, 1997, Langdale, Cumbria, United Kingdom
	Artur Czumaj , Przemka Kanarek , Mirosław Kutyłowski , Krzyztof Loryś, Delayed path coupling and generating random permutations via distributed stochastic processes, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.271-280, January 17-19, 1999, Baltimore, Maryland, United States
	Oded Goldreich , Rafail Ostrovsky, Software protection and simulation on oblivious RAMs, Journal of the ACM (JACM), v.43 n.3, p.431-473, May 1996
	David A. Cooper , Kenneth P. Birman, The design and implementation of a private message service for mobile computers, Wireless Networks, v.1 n.3, p.297-309, 1995
	Shlomi Dolev , Rafail Ostrobsky, Xor-trees for efficient anonymous multicast and reception, ACM Transactions on Information and System Security (TISSEC), v.3 n.2, p.63-84, May 2000
	David Mazières , M. Frans Kaashoek, The design, implementation and operation of an email pseudonym server, Proceedings of the 5th ACM conference on Computer and communications security, p.27-36, November 02-05, 1998, San Francisco, California, United States
	Chin-Chen Chang , Chi-Yien Chung, An efficient protocol for anonymous multicast and reception, Information Processing Letters, v.85 n.2, p.99-103, 31 January 2003
	Marcin Gogolewski , Mirosław Kutyłowski, Secure data storing in a pool of vulnerable servers, Artificial intelligence and security in computing systems, Kluwer Academic Publishers, Norwell, MA, 2003
	Jiejun Kong , Dapeng Wu , Xiaoyan Hong , Mario Gerla, Mobile traffic sensor network versus motion-MIX: tracing and protecting mobile wireless nodes, Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks, November 07-07, 2005, Alexandria, VA, USA
	Martín Abadi , Cédric Fournet, Private authentication, Theoretical Computer Science, v.322 n.3, p.427-476, 6 September 2004
	Philippe Golle , Ari Juels, Parallel mixing, Proceedings of the 11th ACM conference on Computer and communications security, October 25-29, 2004, Washington DC, USA
	Steven S. Seiden , Peter P. Chen , R. F. Lax , J. Chen , Guoli Ding, New bounds for randomized busing, Theoretical Computer Science, v.332 n.1-3, p.63-81, 28 February 2005
	Arjan Durresi, Anonymous communications in the Internet, Cluster Computing, v.10 n.1, p.57-66, March 2007
	Arjan Durresi , Vamsi Paruchuri , Mimoza Durresi , Leonard Barolli, Anonymous Routing for Mobile Wireless Ad Hoc Networks, International Journal of Distributed Sensor Networks, v.3 n.1, p.105-117, January 2007
	Jiejun Kong , Xiaoyan Hong , Mario Gerla, An Identity-Free and On-Demand Routing Scheme against Anonymity Threats in Mobile Ad Hoc Networks, IEEE Transactions on Mobile Computing, v.6 n.8, p.888-902, August 2007
	Marek Klonowski , Mirosław Kutyłowski , Bartłomiej Różański, Hiding Data Sources in P2P Networks, Proceeding of the 2005 conference on Applied Public Key Infrastructure: 4th International Workshop: IWAP 2005, p.225-239, May 09, 2005