000 06214nam a22006735i 4500
001 978-3-540-28628-8
003 DE-He213
005 20240423132455.0
007 cr nn 008mamaa
008 121227s2004 gw | s |||| 0|eng d
020 _a9783540286288
_9978-3-540-28628-8
024 7 _a10.1007/b99099
_2doi
050 4 _aQA268
072 7 _aGPJ
_2bicssc
072 7 _aURY
_2bicssc
072 7 _aCOM083000
_2bisacsh
072 7 _aGPJ
_2thema
072 7 _aURY
_2thema
082 0 4 _a005.824
_223
245 1 0 _aAdvances in Cryptology - CRYPTO 2004
_h[electronic resource] :
_b24th Annual International Cryptology Conference, Santa Barbara, California, USA, August 15-19, 2004, Proceedings /
_cedited by Matt Franklin.
250 _a1st ed. 2004.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2004.
300 _aXI, 579 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,
_x1611-3349 ;
_v3152
505 0 _aLinear Cryptanalysis -- On Multiple Linear Approximations -- Feistel Schemes and Bi-linear Cryptanalysis -- Group Signatures -- Short Group Signatures -- Signature Schemes and Anonymous Credentials from Bilinear Maps -- Foundations -- Complete Classification of Bilinear Hard-Core Functions -- Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins? -- Security of Random Feistel Schemes with 5 or More Rounds -- Efficient Representations -- Signed Binary Representations Revisited -- Compressed Pairings -- Asymptotically Optimal Communication for Torus-Based Cryptography -- How to Compress Rabin Ciphertexts and Signatures (and More) -- Public Key Cryptanalysis -- On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields -- Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring -- Zero-Knowledge -- Multi-trapdoor Commitments and Their Applications to Proofs of Knowledge Secure Under Concurrent Man-in-the-Middle Attacks -- Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model -- Zero-Knowledge Proofs and String Commitments Withstanding Quantum Attacks -- The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols -- Hash Collisions -- Near-Collisions of SHA-0 -- Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions -- Secure Computation -- Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography -- Round-Optimal Secure Two-Party Computation -- Invited Talk -- Security, Liberty, and Electronic Communications -- Stream Cipher Cryptanalysis -- An Improved Correlation Attack Against Irregular Clocked and Filtered Keystream Generators -- Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers.-Faster Correlation Attack on Bluetooth Keystream Generator E0 -- Public Key Encryption -- A New Paradigm of Hybrid Encryption Scheme -- Secure Identity Based Encryption Without Random Oracles -- Bounded Storage Model -- Non-interactive Timestamping in the Bounded Storage Model -- Key Management -- IPAKE: Isomorphisms for Password-Based Authenticated Key Exchange -- Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes -- Efficient Tree-Based Revocation in Groups of Low-State Devices -- Computationally Unbounded Adversaries -- Privacy-Preserving Datamining on Vertically Partitioned Databases -- Optimal Perfectly Secure Message Transmission -- Pseudo-signatures, Broadcast, and Multi-party Computation from Correlated Randomness.
520 _aCrypto 2004, the 24th Annual Crypto Conference, was sponsored by the Int- national Association for Cryptologic Research (IACR) in cooperation with the IEEE Computer Society Technical Committee on Security and Privacy and the Computer Science Department of the University of California at Santa Barbara. The program committee accepted 33 papers for presentation at the conf- ence. These were selected from a total of 211 submissions. Each paper received at least three independent reviews. The selection process included a Web-based discussion phase, and a one-day program committee meeting at New York U- versity. These proceedings include updated versions of the 33 accepted papers. The authors had a few weeks to revise them, aided by comments from the reviewers. However, the revisions were not subjected to any editorial review. Theconferenceprogramincludedtwoinvitedlectures.VictorShoup’sinvited talk was a survey on chosen ciphertext security in public-key encryption. Susan Landau’s invited talk was entitled “Security, Liberty, and Electronic Commu- cations”. Her extended abstract is included in these proceedings. We continued the tradition of a Rump Session, chaired by Stuart Haber. Those presentations (always short, often serious) are not included here.
650 0 _aCryptography.
650 0 _aData encryption (Computer science).
650 0 _aComputer networks .
650 0 _aOperating systems (Computers).
650 0 _aAlgorithms.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aElectronic data processing
_xManagement.
650 1 4 _aCryptology.
650 2 4 _aComputer Communication Networks.
650 2 4 _aOperating Systems.
650 2 4 _aAlgorithms.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aIT Operations.
700 1 _aFranklin, Matt.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540226680
776 0 8 _iPrinted edition:
_z9783662205051
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v3152
856 4 0 _uhttps://doi.org/10.1007/b99099
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188152
_d188152