1. Improved Single-Key Attacks on 8-Round AES-192 and AES-256

   • Orr Dunkelman
   • Nathan Keller
   • Adi Shamir

   OriginalPaper 10 October 2013 Pages: 397 - 422

   

2. GNUC: A New Universal Composability Framework

   • Dennis Hofheinz
   • Victor Shoup

   OriginalPaper 05 October 2013 Pages: 423 - 508

   

3. On the Complexity of Constructing Pseudorandom Functions (Especially when They Don’t Exist)

   • Eric Miles
   • Emanuele Viola

   OriginalPaper 13 November 2013 Pages: 509 - 532

4. How to Achieve Perfect Simulation and a Complete Problem for Non-interactive Perfect Zero-Knowledge

   • Lior Malka

   OriginalPaper 21 November 2013 Pages: 533 - 550

5. Protocols for Multiparty Coin Toss with a Dishonest Majority

   • Amos Beimel
   • Eran Omri
   • Ilan Orlov

   OriginalPaper 19 November 2013 Pages: 551 - 600

   

6. Polynomial-Time Solutions of Computational Problems in Noncommutative-Algebraic Cryptography

   • Boaz Tsaban

   OriginalPaper 15 November 2013 Pages: 601 - 622

   

7. Provable Unlinkability Against Traffic Analysis with Low Message Overhead

   • Ron Berman
   • Amos Fiat
   • Amnon Ta-Shma

   OriginalPaper 14 December 2013 Pages: 623 - 640

8. Tight Security for Signature Schemes Without Random Oracles

   • Sven Schäge

   OriginalPaper 21 December 2013 Pages: 641 - 670

9. A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy

   • Benjamin Fuller
   • Adam O’Neill
   • Leonid Reyzin

   OriginalPaper 13 December 2013 Pages: 671 - 717

   

10. Reflection Cryptanalysis of PRINCE-Like Ciphers

    • Hadi Soleimany
    • Céline Blondeau
    • Yanfeng Wang

    OriginalPaper 13 December 2013 Pages: 718 - 744