LEADER 01001nam0-2200313 --450 001 9910423759903321 005 20220701131712.0 010 $a9788472268272 100 $a20201116d2018----kmuy0itay5050 ba 101 0 $acat 102 $aES 105 $a 001yy 200 1 $aCurial e Guelfa$fedició crítica de Ramon Aramon i Serra$gtext revisat per Joan Santanach ... [et al.]$gestudi y notes de Lola Badia i Jaume Torro 205 $a2. edició, revisada 210 $aBarcelona$cBarcino$d2018 215 $a451 p.$d23 cm 225 1 $a<>nostres clàssics. Autors medievals$v38 676 $a849.9$v20 700 1$aAramon I Serra,$bRamon$0165239 702 1$aBadia,$bLola 702 1$aSantanach,$bJoan 801 0$aIT$bUNINA$gREICAT$2UNIMARC 901 $aBK 912 $a9910423759903321 952 $a849.9 ARA 2 (1 BIS)$bBIBL 2020/1703$fFLFBC 952 $a849.9 ARA 2 (1)$bBIBL 2021/3437$fFLFBC 959 $aFLFBC 996 $aCurial e Guelfa$91761369 997 $aUNINA LEADER 07590nam 22008175 450 001 9910767536703321 005 20250621221628.0 010 $a3-540-45146-3 024 7 $a10.1007/b11817 035 $a(CKB)1000000000212081 035 $a(SSID)ssj0000320924 035 $a(PQKBManifestationID)11256238 035 $a(PQKBTitleCode)TC0000320924 035 $a(PQKBWorkID)10258513 035 $a(PQKB)10428487 035 $a(DE-He213)978-3-540-45146-4 035 $a(MiAaPQ)EBC3087896 035 $a(PPN)155171887 035 $a(EXLCZ)991000000000212081 100 $a20121227d2003 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAdvances in Cryptology -- CRYPTO 2003 $e23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003, Proceedings /$fedited by Dan Boneh 205 $a1st ed. 2003. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2003. 215 $a1 online resource (XII, 636 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2729 300 $aBibliographic Level Mode of Issuance: Monograph 311 1 $a3-540-40674-3 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $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 -- On Memory-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. 330 $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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2729 606 $aData encryption (Computer science) 606 $aComputer networks 606 $aOperating systems (Computers) 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aManagement information systems 606 $aComputer science 606 $aCryptology$3https://scigraph.springernature.com/ontologies/product-market-codes/I28020 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 606 $aOperating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14045 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 606 $aManagement of Computing and Information Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I24067 615 0$aData encryption (Computer science) 615 0$aComputer networks. 615 0$aOperating systems (Computers) 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aManagement information systems. 615 0$aComputer science. 615 14$aCryptology. 615 24$aComputer Communication Networks. 615 24$aOperating Systems. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aManagement of Computing and Information Systems. 676 $a005.8205 702 $aBoneh$b Dan$f1969-$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910767536703321 996 $aAdvances in Cryptology -- CRYPTO 2003$91935974 997 $aUNINA