Reducing Complexity Assumptions for Statistically-Hiding Commitment Iftach HaitnerOmer HorvitzRonen Shaltiel OriginalPaper 22 September 2007 Pages: 283 - 310
On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions J. BlackM. CochranT. Shrimpton OriginalPaper 23 September 2008 Pages: 311 - 329
Using Abelian Varieties to Improve Pairing-Based Cryptography K. RubinA. Silverberg OriginalPaper 19 September 2008 Pages: 330 - 364
Upper and Lower Bounds on Black-Box Steganography Nenad DedićGene ItkisScott Russell OriginalPaper 08 April 2008 Pages: 365 - 394
General Composition and Universal Composability in Secure Multiparty Computation Yehuda Lindell OriginalPaper 29 March 2008 Pages: 395 - 428