Table of contents for issues of Lecture Notes in Computer Science

Last update: Thu Mar 14 12:19:05 MDT 2019                Valid HTML 3.2!

Volume 3621, 2005
Papers beginning 2005
Volume 3718, 2005


Lecture Notes in Computer Science
Volume 3621, 2005

               Xiaoyun Wang and   
                  Hongbo Yu and   
                 Yiqun Lisa Yin   Efficient Collision Search Attacks on
                                  SHA-0  . . . . . . . . . . . . . . . . . 1
               Xiaoyun Wang and   
             Yiqun Lisa Yin and   
                      Hongbo Yu   Finding Collisions in the Full SHA-1 . . 17
              Cynthia Dwork and   
                  Moni Naor and   
                    Hoeteck Wee   Pebbling and Proofs of Work  . . . . . . 37
             Krzysztof Pietrzak   Composition Does Not Imply Adaptive
                                  Security . . . . . . . . . . . . . . . . 55
                 R. Granger and   
                 F. Vercauteren   On the Discrete Logarithm Problem on
                                  Algebraic Tori . . . . . . . . . . . . . 66
           Alexei Myasnikov and   
         Vladimir Shpilrain and   
              Alexander Ushakov   A Practical Attack on a Braid Group
                                  Based Cryptographic Protocol . . . . . . 86
                      Yi Lu and   
                Willi Meier and   
                 Serge Vaudenay   The Conditional Correlation Attack: A
                                  Practical Attack on Bluetooth Encryption 97
                Rafael Pass and   
                    abhi shelat   Unconditional Characterizations of
                                  Non-interactive Zero-Knowledge . . . . . 118
             Joë Alwen and   
          Giuseppe Persiano and   
                  Ivan Visconti   Impossibility and Feasibility Results
                                  for Zero Knowledge with Public Keys  . . 135
                  Marc Fischlin   Communication-Efficient Non-interactive
                                  Proofs of Knowledge with Online
                                  Extractors . . . . . . . . . . . . . . . 152
              Jan Camenisch and   
               Anna Lysyanskaya   A Formal Treatment of Onion Routing  . . 169
                   Kun Peng and   
                 Colin Boyd and   
                      Ed Dawson   Simple and Efficient Shuffling with
                                  Provable Correctness and ZK Privacy  . . 188
             Michel Abdalla and   
              Mihir Bellare and   
             Dario Catalano and   
                 Eike Kiltz and   
            Tadayoshi Kohno and   
                Tanja Lange and   
            John Malone-Lee and   
              Gregory Neven and   
            Pascal Paillier and   
                     Haixia Shi   Searchable Encryption Revisited:
                                  Consistency Properties, Relation to
                                  Anonymous IBE, and Extensions  . . . . . 205
           Rafail Ostrovsky and   
          William E. Skeith III   Private Searching on Streaming Data  . . 223
                Lea Kissner and   
                      Dawn Song   Privacy-Preserving Set Operations  . . . 241
                  Dan Boneh and   
               Craig Gentry and   
                   Brent Waters   Collusion Resistant Broadcast Encryption
                                  with Short Ciphertexts and Private Keys  258
            Jung Yeon Hwang and   
              Dong Hoon Lee and   
                     Jongin Lim   Generic Transformation for Scalable
                                  Broadcast Encryption Schemes . . . . . . 276
                  Ari Juels and   
                Stephen A. Weis   Authenticating Pervasive Devices with
                                  Human Protocols  . . . . . . . . . . . . 293
                 Serge Vaudenay   Secure Communications over Insecure
                                  Channels Based on Short Authenticated
                                  Strings  . . . . . . . . . . . . . . . . 309
              Ronald Cramer and   
                Vanesa Daza and   
             Ignacio Gracia and   
 Jorge Jiménez Urroz and   
             Gregor Leander and   
Jaume Martí-Farré and   
            Carles Padró   On Codes, Matroids and Secure
                                  Multi-party Computation from Linear
                                  Secret Sharing Schemes . . . . . . . . . 327
              Ronald Cramer and   
                 Serge Fehr and   
                   Martijn Stam   Black-Box Secret Sharing from Primitive
                                  Sets in Algebraic Number Fields  . . . . 344
                 Boaz Barak and   
                Ran Canetti and   
             Yehuda Lindell and   
                Rafael Pass and   
                      Tal Rabin   Secure Computation Without
                                  Authentication . . . . . . . . . . . . . 361
         Ivan Damgård and   
                    Yuval Ishai   Constant-Round Multiparty Computation
                                  Using a Black-Box Pseudorandom Generator 378
                Omer Barkol and   
                    Yuval Ishai   Secure Computation of Constant-Depth
                                  Circuits with Applications to Database
                                  Search Problems  . . . . . . . . . . . . 395
        Alexandra Boldyreva and   
                  Marc Fischlin   Analysis of Random Oracle Instantiation
                                  Scenarios for OAEP and Other Practical
                                  Schemes  . . . . . . . . . . . . . . . . 412


Lecture Notes in Computer Science
Papers beginning 2005

Jean-Sébastien Coron and   
             Yevgeniy Dodis and   
     Cécile Malinaud and   
                Prashant Puniya   Merkle--Damgård Revisited: How to
                                  Construct a Hash Function  . . . . . . . 430
             Yevgeniy Dodis and   
           Roberto Oliveira and   
             Krzysztof Pietrzak   On the Generic Insecurity of the Full
                                  Domain Hash  . . . . . . . . . . . . . . 449
                Stefan Wolf and   
         Jürg Wullschleger   New Monotones and Lower Bounds in
                                  Unconditional Two-Party Computation  . . 467
          Thomas Holenstein and   
                  Renato Renner   One-Way Secret-Key Agreement and
                                  Applications to Circuit Polarization and
                                  Immunization of Public-Key Encryption    478
         Ivan Damgård and   
  Thomas Brochmann Pedersen and   
                  Louis Salvail   A Quantum Cipher with Near Optimal
                                  Key-Recycling  . . . . . . . . . . . . . 494
     Beno\^\it Chevallier-Mames   An Efficient CDH-Based Signature Scheme
                                  with a Tight Security Reduction  . . . . 511
              Mihir Bellare and   
         Krzysztof Pietrzak and   
                Phillip Rogaway   Improved Security Analyses for CBC MACs  527
                  Hugo Krawczyk   HMQV: A High-Performance Secure
                                  Diffie--Hellman Protocol . . . . . . . . 546


Lecture Notes in Computer Science
Volume 3718, 2005

              S. A. Abramov and   
               M. Bronstein and   
                 D. E. Khmelnov   On Regular and Logarithmic Solutions of
                                  Ordinary Linear Differential Systems . . 1--12
               Saugata Basu and   
                Michael Kettner   Computing the Betti Numbers of
                                  Arrangements in Practice . . . . . . . . 13--31
             I. N. Belyaeva and   
             N. A. Chekanov and   
                A. A. Gusev and   
           V. A. Rostovtsev and   
              Yu. A. Ukolov and   
                   Y. Uwano and   
                 S. I. Vinitsky   A MAPLE Symbolic-Numeric Program for
                                  Solving the $2$D-Eigenvalue Problem by a
                                  Self-consistent Basis Method . . . . . . 32--39
          Rudolf Berghammer and   
                  Frank Neumann   RelView --- an OBDD-Based Computer
                                  Algebra System for Relations . . . . . . 40--51
         M. Borges-Quintana and   
       M. A. Borges-Trenard and   
        E. Martínez-Moro   On the Use of Gröbner Bases for Computing
                                  the Structure of Finite Abelian Groups   52--64
         Alexander D. Bruno and   
              Victor F. Edneral   Normal Forms and Integrability of ODE
                                  Systems  . . . . . . . . . . . . . . . . 65--74
        Laurent Busé and   
             Houssam Khalil and   
               Bernard Mourrain   Resultant-Based Methods for Plane Curves
                                  Intersection Problems  . . . . . . . . . 75--92
              Carlo Cattani and   
      Evgenii A. Grebenikov and   
        Alexander N. Prokopenya   Symbolic Calculations in Studying the
                                  Stability of Dynamically Symmetric
                                  Satellite Motion . . . . . . . . . . . . 93--104
            Dmytro Chibisov and   
              Victor Ganzha and   
              Ernst W. Mayr and   
          Evgenii V. Vorozhtsov   Generation of Orthogonal Grids on
                                  Curvilinear Trimmed Regions in Constant
                                  Time . . . . . . . . . . . . . . . . . . 105--114
            Dmytro Chibisov and   
              Victor Ganzha and   
           Sergey Pankratov and   
               Christoph Zenger   Computer Algebra in Nanosciences:
                                  Modeling Electronic States in Quantum
                                  Dots . . . . . . . . . . . . . . . . . . 115--124
        Arthur D. Chtcherba and   
               Deepak Kapur and   
               Manfred Minimair   Cayley--Dixon Resultant Matrices of
                                  Multi-univariate Composed Polynomials    125--137
           Arno Eigenwillig and   
               Lutz Kettner and   
            Werner Krandick and   
              Kurt Mehlhorn and   
  Susanne Schmitt \textellipsis   A Descartes Algorithm for Polynomials
                                  with Bit-Stream Coefficients . . . . . . 138--149
          Ioannis Z. Emiris and   
            Elias P. Tsigaridas   Real Solving of Bivariate Polynomial
                                  Systems  . . . . . . . . . . . . . . . . 150--161
             J. Gago-Vargas and   
     M. I. Hartillo-Hermoso and   
     J. M. Ucha-Enríquez   Nouvelle Cuisine for the Computation of
                                  the Annihilating Ideal of $ f^s $  . . . 162--173
          Vladimir P. Gerdt and   
                Yuri A. Blinkov   Janet-Like Monomial Division . . . . . . 174--183
          Vladimir P. Gerdt and   
                Yuri A. Blinkov   Janet-Like Gröbner Bases  . . . . . . . . 184--195
       Domingo Gómez and   
            Jaime Gutierrez and   
             Álvar Ibeas   Circulant Digraphs and Monomial Ideals   196--207
       Rocio Gonzalez--Diaz and   
              Belen Medrano and   
                 Pedro Real and   
Javier Sánchez--Peláez   Algebraic Topological Analysis of
                                  Time-Sequence of Digital Images  . . . . 208--219
    Laureano Gonzalez--Vega and   
             Carlo Traverso and   
                 Alberto Zanoni   Hilbert Stratification and Parametric
                                  Gröbner Bases . . . . . . . . . . . . . . 220--235
           E. A. Grebenicov and   
       D. Kozak-Skoworodkin and   
                    M. Jakubiak   Investigation of the Stability Problem
                                  for the Critical Cases of the Newtonian
                                  Many-Body Problem  . . . . . . . . . . . 236--243