05571nam 22007935 450 99646611500331620200705132039.03-540-32732-010.1007/11681878(CKB)1000000000232851(SSID)ssj0000320389(PQKBManifestationID)11286214(PQKBTitleCode)TC0000320389(PQKBWorkID)10249328(PQKB)10884303(DE-He213)978-3-540-32732-5(MiAaPQ)EBC3067812(PPN)123132096(EXLCZ)99100000000023285120100715d2006 u| 0engurnn|008mamaatxtccrTheory of Cryptography[electronic resource] Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006, Proceedings /edited by Shai Halevi, Tal Rabin1st ed. 2006.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2006.1 online resource (XII, 620 p.) Security and Cryptology ;3876Bibliographic Level Mode of Issuance: Monograph3-540-32731-2 Includes bibliographical references and index.Zero-Knowledge -- Concurrent Zero Knowledge Without Complexity Assumptions -- Interactive Zero-Knowledge with Restricted Random Oracles -- Non-interactive Zero-Knowledge from Homomorphic Encryption -- Primitives -- Ring Signatures: Stronger Definitions, and Constructions Without Random Oracles -- Efficient Blind and Partially Blind Signatures Without Random Oracles -- Key Exchange Using Passwords and Long Keys -- Mercurial Commitments: Minimal Assumptions and Efficient Constructions -- Assumptions and Models -- Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices -- On Error Correction in the Exponent -- On the Relation Between the Ideal Cipher and the Random Oracle Models -- The Bounded-Retrieval Model -- Intrusion-Resilience Via the Bounded-Storage Model -- Perfectly Secure Password Protocols in the Bounded Retrieval Model -- Privacy -- Polylogarithmic Private Approximations and Efficient Matching -- Calibrating Noise to Sensitivity in Private Data Analysis -- Secret Sharing and Multi-party Computation (I) -- Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation -- Efficient Multi-party Computation with Dispute Control -- Round-Optimal and Efficient Verifiable Secret Sharing -- Universally-Composible Security -- Generalized Environmental Security from Number Theoretic Assumptions -- Games and the Impossibility of Realizable Ideal Functionality -- Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols -- Resource Fairness and Composability of Cryptographic Protocols -- One-Way Functions and Friends -- Finding Pessiland -- Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness -- On the Complexity of Parallel Hardness Amplification for One-Way Functions -- Secret Sharing and Multi-party Computation (II) -- On Matroids and Non-ideal Secret Sharing -- Secure Computation with Partial Message Loss -- Communication Efficient Secure Linear Algebra -- Threshold and Proactive Pseudo-Random Permutations -- Pseudo-Random Functions and Encryption -- PRF Domain Extension Using DAGs -- Chosen-Ciphertext Security from Tag-Based Encryption -- Separating Sources for Encryption and Secret Sharing.Security and Cryptology ;3876Data encryption (Computer science)AlgorithmsComputer science—MathematicsOperating systems (Computers)Management information systemsComputer scienceComputers and civilizationCryptologyhttps://scigraph.springernature.com/ontologies/product-market-codes/I28020Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Discrete Mathematics in Computer Sciencehttps://scigraph.springernature.com/ontologies/product-market-codes/I17028Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14045Management of Computing and Information Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I24067Computers and Societyhttps://scigraph.springernature.com/ontologies/product-market-codes/I24040Data encryption (Computer science).Algorithms.Computer science—Mathematics.Operating systems (Computers).Management information systems.Computer science.Computers and civilization.Cryptology.Algorithm Analysis and Problem Complexity.Discrete Mathematics in Computer Science.Operating Systems.Management of Computing and Information Systems.Computers and Society.005.8Halevi Shaiedthttp://id.loc.gov/vocabulary/relators/edtRabin Taledthttp://id.loc.gov/vocabulary/relators/edtTheory of Cryptography ConferenceBOOK996466115003316Theory of Cryptography772206UNISA