LEADER 06039nam 22007695 450 001 9910143623403321 005 20251116234118.0 010 $a3-540-44598-6 024 7 $a10.1007/3-540-44598-6 035 $a(CKB)1000000000211291 035 $a(SSID)ssj0000320921 035 $a(PQKBManifestationID)11226748 035 $a(PQKBTitleCode)TC0000320921 035 $a(PQKBWorkID)10262540 035 $a(PQKB)11498824 035 $a(DE-He213)978-3-540-44598-2 035 $a(MiAaPQ)EBC3071769 035 $a(PPN)155189360 035 $a(BIP)13627119 035 $a(BIP)6775812 035 $a(EXLCZ)991000000000211291 100 $a20121227d2000 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAdvances in Cryptology - CRYPTO 2000 $e20th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2000. Proceedings /$fedited by Mihir Bellare 205 $a1st ed. 2000. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2000. 215 $a1 online resource (XI, 543 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1880 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-67907-3 320 $aIncludes bibliographical references and index. 327 $aXTR and NTRU -- The XTR Public Key System -- A Chosen-Ciphertext Attack against NTRU -- Privacy for Databases -- Privacy Preserving Data Mining -- Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing -- Secure Distributed Computation and Applications -- Parallel Reducibility for Information-Theoretically Secure Computation -- Optimistic Fair Secure Computation -- A Cryptographic Solution to a Game Theoretic Problem -- Algebraic Cryptosystems -- Differential Fault Attacks on Elliptic Curve Cryptosystems -- Quantum Public-Key Cryptosystems -- New Public-Key Cryptosystem Using Braid Groups -- Message Authentication -- Key Recovery and Forgery Attacks on the MacDES MAC Algorithm -- CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions -- L-collision Attacks against Randomized MACs -- Digital Signatures -- On the Exact Security of Full Domain Hash -- Timed Commitments -- A Practical and Provably Secure Coalition-Resistant Group Signature Scheme -- Provably Secure Partially Blind Signatures -- Cryptanalysis -- Weaknesses in the SL2( ) Hashing Scheme -- Fast Correlation Attacks through Reconstruction of Linear Polynomials -- Traitor Tracing and Broadcast Encryption -- Sequential Traitor Tracing -- Long-Lived Broadcast Encryption -- Invited Talk -- Taming the Adversary -- Symmetric Encryption -- The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search -- On the Round Security of Symmetric-Key Cryptographic Primitives -- New Paradigms for Constructing Symmetric Encryption Schemes Secure against Chosen-Ciphertext Attack -- To Commit or Not to Commit -- Efficient Non-malleable Commitment Schemes -- Improved Non-committing Encryption Schemes Based on a General Complexity Assumption -- Protocols -- A Note on the Round-Complexity of Concurrent Zero-Knowledge -- An Improved Pseudo-random Generator Based on Discrete Log -- Linking Classical and Quantum Key Agreement: Is There ?Bound Information?? -- Stream Ciphers and Boolean Functions -- Maximum Correlation Analysis of Nonlinear S-boxes in Stream Ciphers -- Nonlinearity Bounds and Constructions of Resilient Boolean Functions -- Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications. 330 $aThis book constitutes the refereed proceedings of the 20th Annual International Cryptology Conference, CRYPTO 2000, held in Santa Barbara, CA, USA in August 2000. The 32 revised full papers presented together with one invited contribution were carefully reviewed and selected from 120 submissions. The papers are organized in topical sections on XTR and NTRU, privacy for databases, secure distributed computation, algebraic cryptosystems, message authentication, digital signatures, cryptanalysis, traitor tracing and broadcast encryption, symmetric encryption, to commit or not to commit, protocols, and stream ciphers and Boolean functions. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1880 606 $aComputer networks 606 $aData encryption (Computer science) 606 $aAlgorithms 606 $aManagement information systems 606 $aComputer science 606 $aComputer science$xMathematics 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 606 $aCryptology$3https://scigraph.springernature.com/ontologies/product-market-codes/I28020 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 $aComputational Mathematics and Numerical Analysis$3https://scigraph.springernature.com/ontologies/product-market-codes/M1400X 615 0$aComputer networks. 615 0$aData encryption (Computer science) 615 0$aAlgorithms. 615 0$aManagement information systems. 615 0$aComputer science. 615 0$aComputer science$xMathematics. 615 14$aComputer Communication Networks. 615 24$aCryptology. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aManagement of Computing and Information Systems. 615 24$aComputational Mathematics and Numerical Analysis. 676 $a005.8/2 702 $aBellare$b Mihir$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aCRYPTO (Conference) 906 $aBOOK 912 $a9910143623403321 996 $aAdvances in cryptology - CRYPTO 2000$9878906 997 $aUNINA