LEADER 07173nam 22008175 450 001 996466163203316 005 20200704045730.0 010 $a3-540-44987-6 024 7 $a10.1007/3-540-44987-6 035 $a(CKB)1000000000211400 035 $a(SSID)ssj0000320940 035 $a(PQKBManifestationID)11229964 035 $a(PQKBTitleCode)TC0000320940 035 $a(PQKBWorkID)10262557 035 $a(PQKB)10421001 035 $a(DE-He213)978-3-540-44987-4 035 $a(MiAaPQ)EBC3073130 035 $a(PPN)155203932 035 $a(EXLCZ)991000000000211400 100 $a20121227d2001 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAdvances in Cryptology ? EUROCRYPT 2001$b[electronic resource] $eInternational Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6?10, 2001, Proceedings /$fedited by Birgit Pfitzmann 205 $a1st ed. 2001. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2001. 215 $a1 online resource (XIII, 544 p. 23 illus.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2045 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-42070-3 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aElliptic Curves -- A Memory Efficient Version of Satoh?s Algorithm -- Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy -- How Secure Are Elliptic Curves over Composite Extension Fields? -- Commitments -- Efficient and Non-interactive Non-malleable Commitment -- How to Convert the Flavor of a Quantum Bit Commitment -- Anonymity -- Cryptographic Counters and Applications to Electronic Voting -- An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation -- Priced Oblivious Transfer: How to Sell Digital Goods -- Signatures and Hash Functions -- A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures -- Practical Threshold RSA Signatures without a Trusted Dealer -- Hash Functions: From Merkle-Damgård to Shoup -- XTR and NTRU -- Key Recovery and Message Attacks on NTRU-Composite -- Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems -- NSS: An NTRU Lattice-Based Signature Scheme -- Assumptions -- The Bit Security of Paillier?s Encryption Scheme and Its Applications -- Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference -- Multiparty Protocols -- On Adaptive vs. Non-adaptive Security of Multiparty Protocols -- Multiparty Computation from Threshold Homomorphic Encryption -- On Perfect and Adaptive Security in Exposure-Resilient Cryptography -- Block Ciphers -- Cryptanalysis of Reduced-Round MISTY -- The Rectangle Attack ? Rectangling the Serpent -- Primitives -- Efficient Amplification of the Security of Weak Pseudo-random Function Generators -- Min-round Resettable Zero-Knowledge in the Public-Key Model -- Symmetric Ciphers -- Structural Cryptanalysis of SASAS -- Hyper-bent Functions -- New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs -- Key Exchange and Multicast -- Lower Bounds for Multicast Message Authentication -- Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels -- Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords -- Authentication and Identification -- Identification Protocols Secure against Reset Attacks -- Does Encryption with Redundancy Provide Authenticity? -- Encryption Modes with Almost Free Message Integrity. 330 $aEUROCRYPT 2001, the 20th annual Eurocrypt conference, was sponsored by the IACR, the International Association for Cryptologic Research, see http://www. iacr. org/, this year in cooperation with the Austrian Computer - ciety (OCG). The General Chair, Reinhard Posch, was responsible for local or- nization, and registration was handled by the IACR Secretariat at the University of California, Santa Barbara. In addition to the papers contained in these proceedings, we were pleased that the conference program also included a presentation by the 2001 IACR d- tinguished lecturer, Andrew Odlyzko, on ?Economics and Cryptography? and an invited talk by Silvio Micali, ?Zero Knowledge Has Come of Age. ? Furthermore, there was the rump session for presentations of recent results and other (p- sibly satirical) topics of interest to the crypto community, which Jean-Jacques Quisquater kindly agreed to run. The Program Committee received 155 submissions and selected 33 papers for presentation; one of them was withdrawn by the authors. The review process was therefore a delicate and challenging task for the committee members, and I wish to thank them for all the e?ort they spent on it. Each committee member was responsible for the review of at least 20 submissions, so each paper was carefully evaluated by at least three reviewers, and submissions with a program committee member as a (co-)author by at least six. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2045 606 $aData encryption (Computer science) 606 $aComputer science?Mathematics 606 $aManagement information systems 606 $aComputer science 606 $aComputer communication systems 606 $aAlgorithms 606 $aComputer mathematics 606 $aCryptology$3https://scigraph.springernature.com/ontologies/product-market-codes/I28020 606 $aMathematics of Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I17001 606 $aManagement of Computing and Information Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I24067 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aComputational Mathematics and Numerical Analysis$3https://scigraph.springernature.com/ontologies/product-market-codes/M1400X 615 0$aData encryption (Computer science). 615 0$aComputer science?Mathematics. 615 0$aManagement information systems. 615 0$aComputer science. 615 0$aComputer communication systems. 615 0$aAlgorithms. 615 0$aComputer mathematics. 615 14$aCryptology. 615 24$aMathematics of Computing. 615 24$aManagement of Computing and Information Systems. 615 24$aComputer Communication Networks. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aComputational Mathematics and Numerical Analysis. 676 $a652.8 702 $aPfitzmann$b Birgit$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466163203316 996 $aAdvances in Cryptology ? EUROCRYPT 2001$91935960 997 $aUNISA