LEADER 06387nam 22007935 450 001 996465387203316 005 20200703230731.0 010 $a3-540-36178-2 024 7 $a10.1007/3-540-36178-2 035 $a(CKB)1000000000211811 035 $a(SSID)ssj0000320908 035 $a(PQKBManifestationID)11254873 035 $a(PQKBTitleCode)TC0000320908 035 $a(PQKBWorkID)10262523 035 $a(PQKB)10198050 035 $a(DE-He213)978-3-540-36178-7 035 $a(MiAaPQ)EBC3071862 035 $a(PPN)155164872 035 $a(EXLCZ)991000000000211811 100 $a20121227d2002 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAdvances in Cryptology - ASIACRYPT 2002$b[electronic resource] $e8th International Conference on the Theory and Application of Cryptology and Information Security, Queenstown, New Zealand, December 1-5, 2002, Proceedings /$fedited by Yuliang Zheng 205 $a1st ed. 2002. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2002. 215 $a1 online resource (XIV, 582 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2501 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-00171-9 320 $aIncludes bibliographical references and index. 327 $aAnalysis of Bernstein?s Factorization Circuit -- A Variant of the Cramer-Shoup Cryptosystem for Groups of Unknown Order -- Looking beyond XTR -- Bounds for Robust Metering Schemes and Their Relationship with A2-code -- Unconditionally Secure Anonymous Encryption and Group Authentication -- Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model -- On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives -- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order -- Efficient Oblivious Transfer in the Bounded-Storage Model -- In How Many Ways Can You Write Rijndael? -- On the Security of Rijndael-Like Structures against Differential and Linear Cryptanalysis -- Threshold Cryptosystems Based on Factoring -- Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments -- Asynchronous Secure Communication Tolerating Mixed Adversaries -- Amplified Boomerang Attack against Reduced-Round SHACAL -- Enhancing Differential-Linear Cryptanalysis -- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations -- Analysis of Neural Cryptography -- The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm -- A Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 2 -- A General Formula of the (t, n)-Threshold Visual Secret Sharing Scheme -- On Unconditionally Secure Robust Distributed Key Distribution Centers -- Short Signatures in the Random Oracle Model -- The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes -- Transitive Signatures Based on Factoring and RSA -- 1-out-of-n Signatures from a Variety of Keys -- A Revocation Scheme with Minimal Storage at Receivers -- Optimistic Mixing for Exit-Polls -- Improved Construction of Nonlinear Resilient S-Boxes -- An Upper Bound on the Number of m-Resilient Boolean Functions -- Group Diffie-Hellman Key Exchange Secure against Dictionary Attacks -- Secure Channels Based on Authenticated Encryption Schemes: A Simple Characterization -- ID-Based Blind Signature and Ring Signature from Pairings -- Hierarchical ID-Based Cryptography -- Crypto-integrity -- Gummy and Conductive Silicone Rubber Fingers Importance of Vulnerability Analysis. 330 $aThis book constitutes the refereed proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2002, held in Singapore, in December 2002. The 34 revised full papers presented together with two invited contributions were carefully reviewed and selected from 173 submissions on the basis of 875 review reports. The papers are organized in topical sections on public key cryptography, authentication, theory, block ciphers, distributed cryptography, cryptanalysis, public key cryptanalysis, secret sharing, digital signatures, applications, Boolean functions, key management, and ID-based cryptography. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2501 606 $aCoding theory 606 $aInformation theory 606 $aData encryption (Computer science) 606 $aComputer communication systems 606 $aOperating systems (Computers) 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aCoding and Information Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/I15041 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 615 0$aCoding theory. 615 0$aInformation theory. 615 0$aData encryption (Computer science). 615 0$aComputer communication systems. 615 0$aOperating systems (Computers). 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 14$aCoding and Information Theory. 615 24$aCryptology. 615 24$aComputer Communication Networks. 615 24$aOperating Systems. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aDiscrete Mathematics in Computer Science. 676 $a005.8 702 $aZheng$b Yuliang$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Conference on the Theory and Application of Cryptology and Information Security 906 $aBOOK 912 $a996465387203316 996 $aAdvances in Cryptology - ASIACRYPT 2002$91935971 997 $aUNISA