000 06593nam a22006735i 4500
001 978-3-540-45146-4
003 DE-He213
005 20240423132455.0
007 cr nn 008mamaa
008 121227s2003 gw | s |||| 0|eng d
020 _a9783540451464
_9978-3-540-45146-4
024 7 _a10.1007/b11817
_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 2003
_h[electronic resource] :
_b23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003, Proceedings /
_cedited by Dan Boneh.
250 _a1st ed. 2003.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2003.
300 _aXII, 636 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 ;
_v2729
505 0 _aPublic Key Cryptanalysis I -- Factoring Large Numbers with the TWIRL Device -- New Partial Key Exposure Attacks on RSA -- Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases -- Alternate Adversary Models -- On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model -- Unconditional Authenticity and Privacy from an Arbitrarily Weak Secret -- Invited Talk I -- On Cryptographic Assumptions and Challenges -- Protocols -- Scalable Protocols for Authenticated Group Key Exchange -- Practical Verifiable Encryption and Decryption of Discrete Logarithms -- Extending Oblivious Transfers Efficiently -- Symmetric Key Cryptanalysis I -- Algebraic Attacks on Combiners with Memory -- Fast Algebraic Attacks on Stream Ciphers with Linear Feedback -- Cryptanalysis of Safer++ -- Public Key Cryptanalysis II -- A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem -- The Impact of Decryption Failures on the Security of NTRU Encryption -- Universal Composability -- Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption -- Universal Composition with Joint State -- Zero-Knowledge -- Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More -- Derandomization in Cryptography -- On Deniability in the Common Reference String and Random Oracle Model -- Algebraic Geometry -- Primality Proving via One Round in ECPP and One Iteration in AKS -- Torus-Based Cryptography -- Public Key Constructions -- Efficient Universal Padding Techniques for Multiplicative Trapdoor One-Way Permutation -- Multipurpose Identity-Based Signcryption -- Invited Talk II -- SIGMA: The ‘SIGn-and-MAc’ Approach to Authenticated Diffie-Hellman and Its Use in the IKE Protocols -- New Problems -- OnMemory-Bound Functions for Fighting Spam -- Lower and Upper Bounds on Obtaining History Independence -- Private Circuits: Securing Hardware against Probing Attacks -- Symmetric Key Constructions -- A Tweakable Enciphering Mode -- A Message Authentication Code Based on Unimodular Matrix Groups -- Luby-Rackoff: 7 Rounds Are Enough for 2 n(1????) Security -- New Models -- Weak Key Authenticity and the Computational Completeness of Formal Encryption -- Plaintext Awareness via Key Registration -- Relaxing Chosen-Ciphertext Security -- Symmetric Key Cryptanalysis II -- Password Interception in a SSL/TLS Channel -- Instant Ciphertext-Only Cryptanalysis of GSM Encrypted Communication -- Making a Faster Cryptanalytic Time-Memory Trade-Off.
520 _aCrypto 2003, the 23rd 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 conference received 169 submissions, of which the program committee selected 34 for presentation. These proceedings contain the revised versions of the 34 submissions that were presented at the conference. These revisions have not been checked for correctness, and the authors bear full responsibility for the contents of their papers. Submissions to the conference represent cutti- edge research in the cryptographic community worldwide and cover all areas of cryptography. Many high-quality works could not be accepted. These works will surely be published elsewhere. The conference program included two invited lectures. Moni Naor spoke on cryptographic assumptions and challenges. Hugo Krawczyk spoke on the ‘SI- and-MAc’approachtoauthenticatedDi?e-HellmananditsuseintheIKEpro- cols. The conference program also included the traditional rump session, chaired by Stuart Haber, featuring short, informal talks on late-breaking research news. Assembling the conference program requires the help of many many people. To all those who pitched in, I am forever in your debt. I would like to ?rst thank the many researchers from all over the world who submitted their work to this conference. Without them, Crypto could not exist. I thank Greg Rose, the general chair, for shielding me from innumerable logistical headaches, and showing great generosity in supporting my e?orts.
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 _aBoneh, Dan.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540406747
776 0 8 _iPrinted edition:
_z9783662177440
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2729
856 4 0 _uhttps://doi.org/10.1007/b11817
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188154
_d188154