+%%%--------------------------------------------------------------------------
+%%% The main bibliography.
+
+@InProceedings{Abdalla:2001:DHIES,
+ author = "Michel Abdalla and Mihir Bellare and Phillip Rogaway",
+ title = "{DHIES}: An Encryption Scheme Based on the
+ {Diffie--Hellman} Problem",
+ crossref = "Naccache:2001:TCC",
+ year = 2001,
+ url = "http://www-cse.ucsd.edu/users/mihir/papers/dhies.html"
+}
+
+@InProceedings{Bellare:1993:ROP,
+ author = "Mihir Bellare and Phillip Rogaway",
+ title = "Random oracles are practical",
+ booktitle = "Proceedings of the First Annual Conference on Computer and
+ Communications Security",
+ organization = "{ACM}",
+ year = 1993,
+ url = "http://www-cse.ucsd.edu/users/mihir/papers/ro.html"
+}
+
+@InProceedings{Bellare:2004:EAX,
+ title = "The {EAX} Mode of Operation",
+ author = "Mihir Bellare and Phillip Rogaway and David Wagner",
+ bibdate = "2004-07-29",
+ bibsource = "DBLP,
+ http://dblp.uni-trier.de/db/conf/fse/fse2004.html#BellareRW04",
+ booktitle = "FSE",
+ booktitle = "Fast Software Encryption, 11th International Workshop,
+ {FSE} 2004, Delhi, India, February 5-7, 2004, Revised
+ Papers",
+ publisher = "Springer",
+ year = 2004,
+ volume = 3017,
+ editor = "Bimal K. Roy and Willi Meier",
+ isbn = "3-540-22171-9",
+ pages = "389--407",
+ series = "Lecture Notes in Computer Science",
+ url = "http://www.cs.berkeley.edu/~daw/papers/eax-fse04.ps"
+}
+
+@InProceedings{Bellare:2006:STE,
+ title = "The Security of Triple Encryption and a Framework for
+ Code-Based Game-Playing Proofs",
+ author = "Mihir Bellare and Phillip Rogaway",
+ bibdate = "2006-07-05",
+ bibsource = "DBLP,
+ http://dblp.uni-trier.de/db/conf/eurocrypt/eurocrypt2006.html#BellareR06",
+ booktitle = "Advances in Cryptology - {EUROCRYPT} 2006, 25th Annual
+ International Conference on the Theory and Applications of
+ Cryptographic Techniques, St. Petersburg, Russia, May 28 -
+ June 1, 2006, Proceedings",
+ publisher = "Springer",
+ year = 2006,
+ volume = 4004,
+ editor = "Serge Vaudenay",
+ isbn = "3-540-34546-9",
+ pages = "409--426",
+ series = "Lecture Notes in Computer Science",
+ note = "Proceedings version of \cite{cryptoeprint:2004:331}"
+}
+
+@InProceedings{Brassard:1989:SZK,
+ author = "Gilles Brassard and Claude Crepeau",
+ title = "Sorting out Zero-Knowledge",
+ booktitle = "Theory and Application of Cryptographic Techniques",
+ pages = "181-191",
+ year = 1989,
+ url = "http://citeseer.nj.nec.com/brassard90sorting.html"
+}
+
+@TechReport{Canetti:2001:UCS,
+ author = "Ran Canetti",
+ title = "Universally Composable Security: {A} New Paradigm for
+ Cryptographic Protocols",
+ added-by = "sti",
+ url = "http://eprint.iacr.org/2000/067",
+ number = "2000/067",
+ month = oct,
+ abstract = "We propose a new paradigm for defining security of
+ cryptographic protocols, called {\sf universally composable
+ security.} The salient property of universally composable
+ definitions of security is that they guarantee security
+ even when a secure protocol is composed with an arbitrary
+ set of protocols, or more generally when the protocol is
+ used as a component of an arbitrary system. This is an
+ essential property for maintaining security of
+ cryptographic protocols in complex and unpredictable
+ environments such as the Internet. In particular,
+ universally composable definitions guarantee security even
+ when an unbounded number of protocol instances are executed
+ concurrently in an adversarially controlled manner, they
+ guarantee non-malleability with respect to arbitrary
+ protocols, and more. We show how to formulate universally
+ composable definitions of security for practically any
+ cryptographic task. Furthermore, we demonstrate that
+ practically any such definition can be realized using known
+ general techniques, as long as only a minority of the
+ participants are corrupted. We then proceed to formulate
+ universally composable definitions of a wide array of
+ cryptographic tasks, including authenticated and secure
+ communication, key-exchange, public-key encryption,
+ signature, commitment, oblivious transfer, zero-knowledge,
+ and more. We also make initial steps towards studying the
+ realizability of the proposed definitions in other natural
+ settings.",
+ keywords = "foundations / cryptographic protocols, security analysis of
+ protocols, concurrent composition",
+ type = "Report",
+ annote = "Revised version of \cite{Canetti:2000:SCM}.",
+ year = 2001,
+ institution = "Cryptology {ePrint} Archive",
+ added-at = "Wed Oct 17 16:02:37 2001",
+ note = "Extended Abstract appeared in proceedings of the 42nd
+ Symposium on Foundations of Computer Science (FOCS), 2001"
+}
+
+@Proceedings{DBLP:conf/fse/2001,
+ editor = "Mitsuru Matsui",
+ title = "Fast Software Encryption, 8th International Workshop, FSE
+ 2001 Yokohama, Japan, April 2-4, 2001, Revised Papers",
+ booktitle = "FSE",
+ publisher = "Springer",
+ series = "Lecture Notes in Computer Science",
+ volume = 2355,
+ year = 2002,
+ isbn = "3-540-43869-6",
+ bibsource = "DBLP, http://dblp.uni-trier.de"
+}
+
+@PhdThesis{Daemen:1995:CHF,
+ author = "Joan Daemen",
+ title = "Cipher and hash function design strategies based on linear
+ and differential cryptanalysis",
+ year = 1995,
+ school = "K. U. Leuven"
+}
+
+@Misc{Ellis:1997:SNS,
+ author = "James Ellis",
+ title = "The Story of Non-Secret Encryption",
+ howpublished = "CESG internal document",
+ month = dec,
+ year = 1997,
+ note = "Released internally in 1987.",
+ url = "http://www.jya.com/ellisdoc.htm"
+}
+
+@Misc{Fisher:2000:Storin-collide,
+ author = "Matthew Fisher",
+ title = "Re: Yet another block cipher: {Storin}",