000 05927nam a22005775i 4500
001 978-3-540-32055-5
003 DE-He213
005 20160624101923.0
007 cr nn 008mamaa
008 100715s2005 gw | s |||| 0|eng d
020 _a9783540320555
_9978-3-540-32055-5
024 7 _a10.1007/b136415
_2doi
050 4 _aQA76.9.A25
072 7 _aURY
_2bicssc
072 7 _aCOM053000
_2bisacsh
082 0 4 _a005.82
_223
245 1 0 _aAdvances in Cryptology – EUROCRYPT 2005
_h[electronic resource] :
_b24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22-26, 2005. Proceedings /
_cedited by Ronald Cramer.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2005.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2005.
300 _aXIV, 578 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v3494
505 0 _aCryptanalysis I -- Cryptanalysis of the Hash Functions MD4 and RIPEMD -- How to Break MD5 and Other Hash Functions -- Collisions of SHA-0 and Reduced SHA-1 -- Theory I -- Reducing Complexity Assumptions for Statistically-Hiding Commitment -- Smooth Projective Hashing and Two-Message Oblivious Transfer -- On Robust Combiners for Oblivious Transfer and Other Primitives -- Encryption I -- Efficient Identity-Based Encryption Without Random Oracles -- Tag-KEM/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM -- Signatures and Authentication -- Secure Remote Authentication Using Biometric Data -- Stronger Security Bounds for Wegman-Carter-Shoup Authenticators -- 3-Move Undeniable Signature Scheme -- Group Signatures with Efficient Concurrent Join -- Algebra and Number Theory I -- Floating-Point LLL Revisited -- Practical Cryptography in High Dimensional Tori -- A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers -- Quantum Cryptography -- Computational Indistinguishability Between Quantum States and Its Cryptographic Application -- Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes -- Secure Protocols -- Compact E-Cash -- Cryptographic Asynchronous Multi-party Computation with Optimal Resilience -- Algebra and Number Theory II -- Differential Cryptanalysis for Multivariate Schemes -- A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem -- Partial Key Exposure Attacks on RSA up to Full Size Exponents -- The RSA Group is Pseudo-Free -- Theory II -- Universally Composable Password-Based Key Exchange -- Mercurial Commitments with Applications to Zero-Knowledge Sets -- Encryption II -- Hierarchical Identity Based Encryption with Constant Size Ciphertext -- Fuzzy Identity-Based Encryption -- Cryptanalysis II -- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work -- Predicting and Distinguishing Attacks on RC4 Keystream Generator -- Related-Key Boomerang and Rectangle Attacks -- On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions -- Broadcast Encryption and Traitor Tracing -- Public Traceability in Traitor Tracing Schemes -- One-Way Chain Based Broadcast Encryption Schemes.
520 _aThese are the proceedings of the 24th Annual IACR Eurocrypt Conference. The conference was sponsored by the International Association for Cryptologic Research(IACR;seewww.iacr.org),thisyearincooperationwiththeComputer Science Department of the University of Aarhus, Denmark. As General Chair, Ivan Damg? ard was responsible for local organization. TheEurocrypt2005ProgramCommittee(PC)consistedof30internationally renowned experts. Their names and a?liations are listed on pages VII and VIII of these proceedings. By the November 15, 2004 submission deadline the PC had received a total of 190 submissions via the IACR Electronic Submission Server. The subsequent selection process was divided into two phases, as usual. In the review phase each submission was carefully scrutinized by at least three independent reviewers, and the review reports, often extensive, were committed to the IACR Web Review System. These were taken as the starting point for the PC-wideWeb-baseddiscussionphase.Duringthisphase,additionalreportswere provided as needed, and the PC eventually had some 700 reports at its disposal. In addition, the discussions generated more than 850 messages, all posted in the system. During the entire PC phase, which started in August 2003 with my earliest invitations to PC members and which continued until March 2005, more than 1000 email messages were communicated. Moreover, the PC received much appreciated assistance from a large body of external reviewers. Their names are listed on page VIII of these proceedings.
650 0 _aComputer science.
650 0 _aComputer Communication Networks.
650 0 _aOperating systems (Computers).
650 0 _aData encryption (Computer science).
650 0 _aComputer software.
650 0 _aComputational complexity.
650 0 _aInformation Systems.
650 1 4 _aComputer Science.
650 2 4 _aData Encryption.
650 2 4 _aComputer Communication Networks.
650 2 4 _aOperating Systems.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aManagement of Computing and Information Systems.
700 1 _aCramer, Ronald.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540259107
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v3494
856 4 0 _uhttp://dx.doi.org/10.1007/b136415
942 _2EBK3827
_cEBK
999 _c33121
_d33121