LEADER 01191nam2-2200409---450 001 990005663540203316 005 20200501155717.0 035 $a000566354 035 $aUSA01000566354 035 $a(ALEPH)000566354USA01 035 $a000566354 100 $a20050316d1981----|||y0itaa50------ba 101 $ager 102 $ade 105 $a0 00||| 200 1 $a<<2: >> Frühe philosophische Schriften. 2$fHelmuth Plessner 210 $aFrankfurt am Main$cSuhrkamp$d1981 215 $a454 p.$d20 cm 461 0$1001000566352$12001$aGesammelte Schriften$v02 620 $dFRANKFURT AM MAIN 676 $a193 700 1$aPLESSNER,$bHelmuth$0152074 702 1$aMARQUARD,$bOdo 702 1$aSCHMIDT,$bRichard Wilhelm 702 1$aDUX,$bGunter 702 1$aWETTERER,$bAngelika 702 1$aZEMLIN,$bMichael-Joachim 801 0$aIT$bSA$c20111219 912 $a990005663540203316 950 0$aDipar.to di Filosofia - Salerno$dDFAA 193 PLE$e1240 FIL 951 $aAA 193 PLE$b1240 FIL 959 $aBK 969 $aFIL 979 $c20121027$lUSA01$h1525 979 $c20121027$lUSA01$h1615 996 $aFrühe philosophische Schriften. 2$91134914 997 $aUNISA LEADER 05571nam 22007935 450 001 996466115003316 005 20200705132039.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(EXLCZ)991000000000232851 100 $a20100715d2006 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aTheory of Cryptography$b[electronic resource] $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 ;$v3876 300 $aBibliographic Level Mode of Issuance: Monograph 311 $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. 410 0$aSecurity and Cryptology ;$v3876 606 $aData encryption (Computer science) 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aOperating systems (Computers) 606 $aManagement information systems 606 $aComputer science 606 $aComputers and civilization 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 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 606 $aOperating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14045 606 $aManagement of Computing and Information Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I24067 606 $aComputers and Society$3https://scigraph.springernature.com/ontologies/product-market-codes/I24040 615 0$aData encryption (Computer science). 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aOperating systems (Computers). 615 0$aManagement information systems. 615 0$aComputer science. 615 0$aComputers and civilization. 615 14$aCryptology. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aOperating Systems. 615 24$aManagement of Computing and Information Systems. 615 24$aComputers and Society. 676 $a005.8 702 $aHalevi$b Shai$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRabin$b Tal$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aTheory of Cryptography Conference 906 $aBOOK 912 $a996466115003316 996 $aTheory of Cryptography$9772206 997 $aUNISA