Table of contents for issues of Lecture Notes in Computer Science

Last update: Sat Oct 14 16:20:43 MDT 2017                Valid HTML 3.2!

Volume 6632, 2011
Volume 6875, 2011


Lecture Notes in Computer Science
Volume 6632, 2011

                      Anonymous   Front Matter . . . . . . . . . . . . . . ??
                  Ronald Cramer   The Arithmetic Codex: Theory and
                                  Applications . . . . . . . . . . . . . . 1--1
                Phong Q. Nguyen   Lattice Reduction Algorithms: Theory and
                                  Practice . . . . . . . . . . . . . . . . 2--6
                 Eike Kiltz and   
         Krzysztof Pietrzak and   
                 David Cash and   
              Abhishek Jain and   
                Daniele Venturi   Efficient Authentication from Hard
                                  Learning Problems  . . . . . . . . . . . 7--26
       Damien Stehlé and   
                  Ron Steinfeld   Making NTRU as Secure as Worst-Case
                                  Problems over Ideal Lattices . . . . . . 27--47
            Diego F. Aranha and   
             Koray Karabina and   
              Patrick Longa and   
       Catherine H. Gebotys and   
             Julio López   Faster Explicit Formulas for Computing
                                  Pairings over Ordinary Curves  . . . . . 48--68
                Amir Moradi and   
             Axel Poschmann and   
                   San Ling and   
              Christof Paar and   
                  Huaxiong Wang   Pushing the Limits: A Very Compact and a
                                  Threshold Implementation of AES  . . . . 69--88
               Elette Boyle and   
                  Gil Segev and   
                   Daniel Wichs   Fully Leakage-Resilient Signatures . . . 89--108
            Mathieu Renauld and   
François-Xavier Standaert and   
  Nicolas Veyrat-Charvillon and   
                     Dina Kamel   A Formal Study of Power Variability
                                  Issues and Side-Channel Attacks for
                                  Nanoscale Devices  . . . . . . . . . . . 109--128
               Craig Gentry and   
                    Shai Halevi   Implementing Gentry's Fully-Homomorphic
                                  Encryption Scheme  . . . . . . . . . . . 129--148
                  Dan Boneh and   
          David Mandell Freeman   Homomorphic Signatures for Polynomial
                                  Functions  . . . . . . . . . . . . . . . 149--168
              Rikke Bendlin and   
        Ivan Damgaård and   
            Claudio Orlandi and   
                 Sarah Zakarias   Semi-homomorphic Encryption and
                                  Multiparty Computation . . . . . . . . . 169--188
               Sven Schäge   Tight Proofs for Signature Schemes
                                  without Random Oracles . . . . . . . . . 189--206
             Dario Catalano and   
                Dario Fiore and   
               Bogdan Warinschi   Adaptive Pseudo-free Groups and
                                  Applications . . . . . . . . . . . . . . 207--223
               Georg Fuchsbauer   Commuting Signatures and Verifiable
                                  Encryption . . . . . . . . . . . . . . . 224--245
             Niek J. Bouman and   
                     Serge Fehr   Secure Authentication from a Weak Key,
                                  without Leaking Information  . . . . . . 246--265
                Hadi Ahmadi and   
          Reihaneh Safavi-Naini   Secret Keys from Channel Noise . . . . . 266--283
                  Satoshi Obana   Almost Optimum $t$-Cheater Identifiable
                                  Secret Sharing Schemes . . . . . . . . . 284--302
                 Gregor Leander   On Linear Hulls, Statistical Saturation
                                  Attacks, PRESENT and a Cryptanalysis of
                                  PUFFIN . . . . . . . . . . . . . . . . . 303--322
             Yevgeniy Dodis and   
               John Steinberger   Domain Extension for MACs Beyond the
                                  Birthday Barrier . . . . . . . . . . . . 323--342
           Pouyan Sepehrdad and   
             Serge Vaudenay and   
                Martin Vuagnoux   Statistical Attack on RC4  . . . . . . . 343--363
                Anja Becker and   
Jean-Sébastien Coron and   
                   Antoine Joux   Improved Generic Algorithms for Hard
                                  Knapsacks  . . . . . . . . . . . . . . . 364--385
                Abhi shelat and   
                  Chih-hao Shen   Two-Output Secure Computation with
                                  Malicious Adversaries  . . . . . . . . . 386--405
                Yuval Ishai and   
           Eyal Kushilevitz and   
           Rafail Ostrovsky and   
          Manoj Prabhakaran and   
                     Amit Sahai   Efficient Non-interactive Secure
                                  Computation  . . . . . . . . . . . . . . 406--425
              Gilad Asharov and   
                Ran Canetti and   
                   Carmit Hazay   Towards a Game Theoretic View of Secure
                                  Computation  . . . . . . . . . . . . . . 426--445
                 Yehuda Lindell   Highly-Efficient Universally-Composable
                                  Commitments Based on the DDH Assumption  446--466
                Dominique Unruh   Concurrent Composition in the Bounded
                                  Quantum Storage Model  . . . . . . . . . 467--486
          Thomas Ristenpart and   
              Hovav Shacham and   
               Thomas Shrimpton   Careful with Composition: Limitations of
                                  the Indifferentiability Framework  . . . 487--506
                 Tal Malkin and   
            Isamu Teranishi and   
                      Moti Yung   Efficient Circuit-Size Independent
                                  Public Key Encryption with KDM Security  507--526
                Benny Applebaum   Key-Dependent Message Security: Generic
                                  Amplification and Completeness . . . . . 527--546
              Allison Lewko and   
                   Brent Waters   Unbounded HIBE and Attribute-Based
                                  Encryption . . . . . . . . . . . . . . . 547--567
              Allison Lewko and   
                   Brent Waters   Decentralizing Attribute-Based
                                  Encryption . . . . . . . . . . . . . . . 568--588
                    Hoeteck Wee   Threshold and Revocation Cryptosystems
                                  via Extractable Hash Proofs  . . . . . . 589--609
        Markus Dürmuth and   
          David Mandell Freeman   Deniable Encryption with Negligible
                                  Detection Probability: An Interactive
                                  Construction . . . . . . . . . . . . . . 610--626
                      Anonymous   Back Matter  . . . . . . . . . . . . . . ??


Lecture Notes in Computer Science
Volume 6875, 2011

                 Hermann Kopetz   What I Learned from Brian  . . . . . . . 1--6
              John L. Lloyd and   
                   Tom Anderson   Brian Randell: a Biographical Note . . . 7--14
             Algirdas Avi ienis   On Building a Referee's Avatar . . . . . 15--22
          Martin Campbell-Kelly   From Theory to Practice: The Invention
                                  of Programming, 1947--51 . . . . . . . . 23--37
                    David Lomet   Transactions: From Local Atomicity to
                                  Atomicity in the Cloud . . . . . . . . . 38--52
                    John Rushby   From DSS to MILS . . . . . . . . . . . . 53--57
                    Doron Swade   Pre-electronic Computing . . . . . . . . 58--83
                 Brian Wichmann   Whetstone Wanderings . . . . . . . . . . 84--92
                 Jean Bacon and   
           Andrei Iu. Bejan and   
      Alastair R. Beresford and   
                David Evans and   
             Richard J. Gibbens   Using Real-Time Road Traffic Data to
                                  Evaluate Congestion  . . . . . . . . . . 93--117
  Jean-Pierre Banâtre and   
            Christine Morin and   
                  Thierry Priol   Fault Tolerant Autonomic Computing
                                  Systems in a Chemical Setting  . . . . . 118--129
                    Gordon Bell   Out of a Closet: The Early Years of The
                                  Computer Museum  . . . . . . . . . . . . 130--146
                 Alan Burns and   
                  Sanjoy Baruah   Timing Faults and Mixed Criticality
                                  Systems  . . . . . . . . . . . . . . . . 147--166
                Paul E. Ceruzzi   Professor Brian Randell and the History
                                  of Computing . . . . . . . . . . . . . . 167--173
                     Ed Coffman   Computer Storage Fragmentation:
                                  Pioneering Work of Brian Randell . . . . 174--184
                    Lynn Conway   IBM-ACS: Reminiscences and Lessons
                                  Learned from a 1960's Supercomputer
                                  Project  . . . . . . . . . . . . . . . . 185--224
        Pierre-Jacques Courtois   The Belgian Electronic Mathematical
                                  Machine (1951--1962): an Account . . . . 225--237
                    Marc Dacier   On the Resilience of the Dependability
                                  Framework to the Intrusion of New
                                  Security Threats . . . . . . . . . . . . 238--250
               Peter J. Denning   Virtual Fault Tolerance  . . . . . . . . 251--260
                     Tony Hoare   Recovery Blocks  . . . . . . . . . . . . 261--266
                  J. J. Horning   The Development and Writing of ``Process
                                  Structuring''  . . . . . . . . . . . . . 267--272