LEADER 06121nam 22007935 450 001 996465720103316 005 20200703111523.0 024 7 $a10.1007/11593447 035 $a(CKB)1000000000213544 035 $a(SSID)ssj0000315799 035 $a(PQKBManifestationID)11210980 035 $a(PQKBTitleCode)TC0000315799 035 $a(PQKBWorkID)10256691 035 $a(PQKB)10753540 035 $a(DE-He213)978-3-540-32267-2 035 $a(MiAaPQ)EBC3067763 035 $a(PPN)123098785 035 $a(EXLCZ)991000000000213544 100 $a20100410d2005 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAdvances in Cryptology ? ASIACRYPT 2005$b[electronic resource] $e11th International Conference on the Theory and Application of Cryptology and Information Security, Chennai, India, December 4-8, 2005, Proceedings /$fedited by Bimal Kumar Roy 205 $a1st ed. 2005. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2005. 215 $a1 online resource (XIV, 706 p.) 225 1 $aSecurity and Cryptology ;$v3788 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-32267-1 311 $a3-540-30684-6 320 $aIncludes bibliographical references and index. 327 $aAlgebra and Number Theory -- Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log -- Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log? -- Adapting Density Attacks to Low-Weight Knapsacks -- Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains -- Multiparty Computation -- Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation -- Graph-Decomposition-Based Frameworks for Subset-Cover Broadcast Encryption and Efficient Instantiations -- Revealing Additional Information in Two-Party Computations -- Zero Knowledge and Secret Sharing -- Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation -- Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes -- Updatable Zero-Knowledge Databases -- Information and Quantum Theory -- Simple and Tight Bounds for Information Reconciliation and Privacy Amplification -- Quantum Anonymous Transmissions -- Privacy and Anonymity -- Privacy-Preserving Graph Algorithms in the Semi-honest Model -- Spreading Alerts Quietly and the Subgroup Escape Problem -- A Sender Verifiable Mix-Net and a New Proof of a Shuffle -- Universally Anonymizable Public-Key Encryption -- Cryptanalytic Techniques -- Fast Computation of Large Distributions and Its Cryptographic Applications -- An Analysis of the XSL Algorithm -- Stream Cipher Cryptanalysis -- New Applications of Time Memory Data Tradeoffs -- Linear Cryptanalysis of the TSC Family of Stream Ciphers -- A Practical Attack on the Fixed RC4 in the WEP Mode -- A Near-Practical Attack Against B Mode of HBB -- Block Ciphers and Hash Functions -- New Improvements of Davies-Murphy Cryptanalysis -- A Related-Key Rectangle Attack on the Full KASUMI -- Some Attacks Against a Double Length Hash Proposal -- A Failure-Friendly Design Principle for Hash Functions -- Bilinear Maps -- Identity-Based Hierarchical Strongly Key-Insulated Encryption and Its Application -- Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps -- Verifier-Local Revocation Group Signature Schemes with Backward Unlinkability from Bilinear Maps -- Key Agreement -- Modular Security Proofs for Key Agreement Protocols -- A Simple Threshold Authenticated Key Exchange from Short Secrets -- Examining Indistinguishability-Based Proof Models for Key Establishment Protocols -- Provable Security -- Server-Aided Verification: Theory and Practice -- Errors in Computational Complexity Proofs for Protocols -- Signatures -- Universal Designated Verifier Signature Proof (or How to Efficiently Prove Knowledge of a Signature) -- Efficient Designated Confirmer Signatures Without Random Oracles or General Zero-Knowledge Proofs -- Universally Convertible Directed Signatures. 410 0$aSecurity and Cryptology ;$v3788 606 $aCoding theory 606 $aInformation theory 606 $aData encryption (Computer science) 606 $aOperating systems (Computers) 606 $aAlgorithms 606 $aManagement information systems 606 $aComputer science 606 $aComputer communication systems 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 $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 $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 615 0$aCoding theory. 615 0$aInformation theory. 615 0$aData encryption (Computer science). 615 0$aOperating systems (Computers). 615 0$aAlgorithms. 615 0$aManagement information systems. 615 0$aComputer science. 615 0$aComputer communication systems. 615 14$aCoding and Information Theory. 615 24$aCryptology. 615 24$aOperating Systems. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aManagement of Computing and Information Systems. 615 24$aComputer Communication Networks. 676 $a003.54 702 $aRoy$b Bimal Kumar$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465720103316 996 $aAdvances in Cryptology - ASIACRYPT 2005$9772330 997 $aUNISA