LEADER 05643nam 22008895 450 001 9910484779603321 005 20251226202916.0 010 $a3-540-32732-0 024 7 $a10.1007/11681878 035 $a(CKB)1000000000232851 035 $a(SSID)ssj0000320389 035 $a(PQKBManifestationID)11286214 035 $a(PQKBTitleCode)TC0000320389 035 $a(PQKBWorkID)10249328 035 $a(PQKB)10884303 035 $a(DE-He213)978-3-540-32732-5 035 $a(MiAaPQ)EBC3067812 035 $a(PPN)123132096 035 $a(BIP)34163978 035 $a(BIP)13291443 035 $a(EXLCZ)991000000000232851 100 $a20100715d2006 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aTheory of Cryptography $eThird Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006, Proceedings /$fedited by Shai Halevi, Tal Rabin 205 $a1st ed. 2006. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006. 215 $a1 online resource (XII, 620 p.) 225 1 $aSecurity and Cryptology,$x2946-1863 ;$v3876 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-32731-2 320 $aIncludes bibliographical references and index. 327 $aZero-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. 330 $aThis book constitutes the refereed proceedings of the Third Theory of Cryptography Conference, TCC 2006, held in March 2006. The 31 revised full papers presented were carefully reviewed and selected from 91 submissions. The papers are organized in topical sections on zero-knowledge, primitives, assumptions and models, the bounded-retrieval model, privacy, secret sharing and multi-party computation, universally-composible security, one-way functions and friends, and pseudo-random functions and encryption. 410 0$aSecurity and Cryptology,$x2946-1863 ;$v3876 606 $aCryptography 606 $aData encryption (Computer science) 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aOperating systems (Computers) 606 $aElectronic data processing$xManagement 606 $aComputers and civilization 606 $aCryptology 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aOperating Systems 606 $aIT Operations 606 $aComputers and Society 615 0$aCryptography. 615 0$aData encryption (Computer science). 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aOperating systems (Computers). 615 0$aElectronic data processing$xManagement. 615 0$aComputers and civilization. 615 14$aCryptology. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aOperating Systems. 615 24$aIT Operations. 615 24$aComputers and Society. 676 $a005.8 701 $aHalevi$b Shai$01754266 701 $aRabin$b Tal$01757814 712 12$aTheory of Cryptography Conference 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484779603321 996 $aTheory of cryptography$94201628 997 $aUNINA