Seminar Course on Algorithms for Privacy and Security

Course website


The following topics will be covered


  • Diffie-Hellman key exchanges. W. Diffie and M.E. Hellman, New directions in cryptography, IEEE Transactions on Information Theory 22 (1976), 644-654. link.

  • RSA paper. Rivest, R.; A. Shamir; L. Adleman (1978). "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems". Communications of the ACM 21 (2): 120–126. link.

  • Pallier paper. Pascal Paillier, Public-Key Cryptosystems Based on Composite Degree Residuosity Classes, EUROCRYPT 1999, pp223-238. link.

Cryptographic Hashes

  • B. Preneel. Cryptographic hash functions. European transactions on telecommunications and related technologies, 1994. link

  • S Bakhtiari, R Safavi-Naini, J Pieprzyk. Cryptographic hash functions: A survey. Technical Report, University of Wollongong, Australia, 1995. link

  • Coppersmith, Don. The data encryption standard (DES) and its strength against attacks. IBM Journal of Research and Development, 38(3), 243-250, 1994. link

  • Rivest, R., "The MD4 message digest algorithm", in A.J. Menezes and S.A. Vanstone, editors, Advances in Cryptology - CRYPTO '90 Proceedings, pages 303-311, Springer-Verlag, 1991. link

  • R. Rivest. The MD5 Message-Digest Algorithm. Network Working Group RFC 1321, 1992. link

  • Xiaoyun Wang; Hongbo Yu. "How to Break MD5 and Other Hash Functions". EUROCRYPT. ISBN 3-540-25910-4, 2004. link

Homomorphic encryption.

  • R. L. Rivest, L. Adleman, and M. L. Dertouzos. On data banks and privacy homomorphisms. In Foundations of Secure Computation, 1978.

  • Craig Gentry. Fully Homomorphic Encryption Using Ideal Lattices. In the 41st ACM Symposium on Theory of Computing (STOC), 2009. link


  • Yao's Millonaire problem. Andrew Chi-Chih Yao: Protocols for Secure Computations (Extended Abstract). FOCS 1982: 160-164 link

  • Peter Bogetoft et al. Multiparty Computation Goes Live, Cryptology ePrint Archive: Report 2008/068. link

Secret Sharing

  • Blakley, G. R. "Safeguarding cryptographic keys". Proceedings of the National Computer Conference 48: 313–317, 1979.

  • Shamir, Adi. "How to share a secret". Communications of the ACM 22 (11): 612–613, 1979. link

Oblivious transfer

  • Michael O. Rabin. "How to exchange secrets by oblivious transfer." Technical Report TR-81, Aiken Computation Laboratory, Harvard University, 1981. link

Zero knowledge proofs

  • Jean-Jacques Quisquater, Louis C. Guillou, Thomas A. Berson. How to Explain Zero-Knowledge Protocols to Your Children. Advances in Cryptology - CRYPTO '89: Proceedings, v.435, p.628-631, 1990. link.

  • M. Blum, How to prove a theorem so no one else can claim it. International Congress of Mathematicians (Berkeley, CA, 1986), 1444-1451, AMS Providence, RI, 1987.

  • J. Feigenbaum. Overview of Interactive Proof Systems and Zero-Knowledge. Contemporary Cryptology: The Science of Information Integrity. IEEE Press, 1992, pp. 423-439.


  • Nicholas Hopper, John Langford and Luis Von Ahn. Provably Secure Steganography. Advances in Cryptology, CRYPTO 2002. pp 77-92. link

  • Luis von Ahn, Nick Hopper, and John Langford Covert Two-Party Computation. STOC 2005 link

  • Kessler, GC. An Overview of Steganography for the Computer Forensics Examiner. Forensic Science Communications 6 (3), 2004. link

  • Petitcolas, FAP; Anderson RJ; Kuhn MG. Information Hiding: A survey. Proceedings of the IEEE (special issue) 87 (7): 1062–78, 1999. link


  • Jana Dittmann, David Megias, Andreas Lang, Jordi Herrera-Joancomarti; Theoretical framework for a practical evaluation and comparison of audio watermarking schemes in the triangle of robustness, transparency and capacity; In: Transaction on Data Hiding and Multimedia Security I; Springer LNCS 4300; Editor Yun Q. Shi; pp. 1-40

Privacy-Preserving Data Mining Algorithms

  • Decision trees. Jaideep Vaidya, Chris Clifton, Murat Kantarcioglu and A. Scott Patterson. "Privacy Preserving Decision Tree Classification over Vertically Partitioned Data". ACM Transactions on Knowledge Discovery in Databases, 2(3), October, 2008, ACM. link

  • KNN. Yinian Qi and Mikhail Atallah. Efficient Privacy-Preserving k-Nearest Neighbor Search. In Proceedings of The 28th International Conference on Distributed Computing Systems (ICDCS). link

  • SVD. Shuguo Han, Wee Keong Ng, and Philip S. Yu. "Privacy-Preserving Singular Value Decomposition". In Proceedings of the 25th IEEE International Conference on Data Engineering (ICDE'09) , pages 1267--1270. 2009. link

  • Hwanjo Yu, Jaideep Vaidya and Xiaoqian Jiang. "Privacy-Preserving SVM Classification on Vertically Partitioned Data", In Proceedings of the 10th Pacific-Asia Conference on Knowledge Discovery and Data Mining, 2006. link

  • O. L. Mangasarian and E. W. Wild. Privacy-Preserving Classification of Horizontally Partitioned Data via Random Kernels. Proceedings of the 2008 International Conference on Data Mining DMIN08, Volume II, 473-479, 2008. link

  • Distance metrics. P. Ravikumar, W. W. Cohen, S. E. Fienberg. A Secure Protocol for Computing String Distance Metrics. In IEEE International Conference on Data Mining (ICDM) 04, Workshop on Privacy and Security Aspects of Data Mining, 2004. link

Blind Vision.

  • Shai Avidan and Moshe Butman. Blind Vision. In Proceedings of the European Conference on Computer Vision (ECCV), 2006. link

Deaf Audio

Types of Adversaries

Computational complexity

Topic revision: r11 - 2012-01-22 - 18:56:51 - ManasPathak
This site is powered by the TWiki collaboration platformCopyright © by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback