Cryptographic defense against traffic analysis

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129585, Issue , 1993, Pages 672-681

  Rackoff, Charles ^a   Simon, Daniel R ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; RANDOM PROCESSES; DATA COMMUNICATION SYSTEMS; DATA HANDLING; IDENTIFICATION (CONTROL SYSTEMS); MATHEMATICAL MODELS; NETWORK PROTOCOLS; PROGRAM PROCESSORS; SECURITY OF DATA; THEOREM PROVING;

CRYPTOGRAPHIC TECHNIQUES; EFFICIENT PROTOCOLS; NON-INTERACTIVE ZERO-KNOWLEDGE PROOFS; PROVABLY SECURE; SECURE MULTI-PARTY COMPUTATION; TRAFFIC ANALYSIS; UN TRACEABILITYS;

COMPUTATION THEORY; TELECOMMUNICATION TRAFFIC;

CRYPTOGRAPHIC DEFENSE; NONINTERACTIVE ZERO KNOWLEDGE PROOF; SECURE MULTIPARTY COMPUTATION; TRAFFIC ANALYSIS;

EID: 0027224328     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/167088.167260     Document Type: Conference Paper

References (24)

1. [B] D. Beaver, Foundations of Secure Interactive Computing, Advances in Cryptology: Proc. CRYPTO '91.
2. [BFM] M. Blum, P. Feldman, and S. Micali, Non- Interactive Zero Knowledge and its Applica-Tions, Proc. 20th ACM Symposium on Theory of Computing (1988), pp. 103-112.
3. [BG] M. Blum and S. Goldwasser, An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information, Ad-vances in Cryptology: Proc. CRYPTO '84, pp. 289-302.
4. [BMR] D. Beaver, S. Micali and P. Rogaway, The Round Complexity of Secure Protocols, Proc. 22nd ACM Symposium on Theory of Comput-ing (1990), pp. 503-513.
5. [Chi] D. Chaum, Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms, CACM vol. 24, no. 2 (1981), p. 84-88.
6. [Ch2] D. Chaum, The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability, Journal of Cryptology vol. 1, no. 1 (1988), pp. 65-75.
7. [Ch3] D. Chaum, Achieving Electronic Privacy, Scientific American, vol. 267, no. 2 (1992), pp. 96-101.
8. [DDN] D. Dolev, C. Dwork and M. Naor, Non- Malleable Cryptography, proc. 23rd ACM Symposium on Theory of Computing (1991), pp. 542-552.
9. [Go] O. Goldreich, Towards a Theory of Soft-ware Protection and Simulation by Oblivious RAMs, proc. 19th ACM Symposium on The-ory of Computing 1987, pp. 182-194.
10. [GK] O. Goldreich and H. Krawczyk, On the Com-position of Zero-Knowledge Proof Systems, Proc. ICALP '90.
11. [GMRa] S. Goldwasser, S. Micali and C. Rackoff, The Knowledge Complexity of Interactive Proof Systems, Proc. 17th ACM Symp. on Theory of Computing (1985), pp. 291-304.
12. [GMW] O. Goldreich, S. Micali and A Wigderson, How To Play Any Mental Game, proc. 19th ACM Symposium on Theory of Computing (1987), pp. 218-229.
13. [K] D. Knuth, The Art of Computer Program-ming, 2nd ed., Addison-Wesley Pub. Co., Reading, Mass., 1975.
14. [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.
15. [MR] S. Micali and P. Rogaway, Secure Com-putation, Advances in Cryptology: Proc. CRYPTO '91.
16. [Os] R. Ostrovsky, Efficient Computation on Oblivious RAMs, proc. 31st IEEE Symp. on Foundations of Computer Science (1990), pp. 514-523.
17. [P] A. Pfitzmann, How to Implement ISDNs Without User Observability-Some Remarks, TR 14/85, Fakultat fur Informatik, Univer- sitat Karlsruhe, 1985.
18. [PPW] A. Pfitzmann, B. Pfitzmann and M. Waidner, ISDN-MIXes-Untraceable Communica-Tion with Very Small Bandwidth Overhead, Proc. Kommunikation in verteilten Systemen (1991), pp. 451-463.
19. [Sh] A. Shamir, How to Share a Secret, CACM, vol. 22, no. 11 (1979), pp. 612-613.
20. [Si] D. Simon, On Defining and Achieving Crypto-graphic Security in a Multiparty Network, PhD thesis, University of Toronto, 1992.
21. [SJ] A. Sinclair and M.R. Jerrum, Approximate Counting, Uniform Generation, and Rapidly Mixing Markov Chains, Information and Com-putation, vo. 82, no. 1 (1990), pp. 93-133.
22. [SV] M. Santha and U.V. Vazirani, Generat-ing Quasi-Random Sequences from Slightly- Random Sources, Proc. 25th ACM Symp. on Theory of Computing (1984), pp. 434-440.
23. [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.
24. [Y] A.C. Yao, How to Generate and Exchange Se-crets, Proc. 27th IEEE Symp. on Foundations of Computer Science (1986), pp. 162-167.