LEADER 05997nam 22009375 450 001 9910482979803321 005 20251226200124.0 010 $a3-540-78524-8 024 7 $a10.1007/978-3-540-78524-8 035 $a(CKB)1000000000491036 035 $a(SSID)ssj0000320387 035 $a(PQKBManifestationID)11286213 035 $a(PQKBTitleCode)TC0000320387 035 $a(PQKBWorkID)10248444 035 $a(PQKB)10930186 035 $a(DE-He213)978-3-540-78524-8 035 $a(MiAaPQ)EBC4975463 035 $a(MiAaPQ)EBC5591600 035 $a(MiAaPQ)EBC6511671 035 $a(Au-PeEL)EBL4975463 035 $a(CaONFJC)MIL134519 035 $a(OCoLC)1024284697 035 $a(Au-PeEL)EBL5591600 035 $a(OCoLC)233973970 035 $a(Au-PeEL)EBL6511671 035 $a(PPN)123743818 035 $a(EXLCZ)991000000000491036 100 $a20100301d2008 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aTheory of Cryptography $eFifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008, Proceedings /$fedited by Ran Canetti 205 $a1st ed. 2008. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2008. 215 $a1 online resource (XII, 645 p.) 225 1 $aSecurity and Cryptology,$x2946-1863 ;$v4948 300 $aIncludes index. 311 08$a3-540-78523-X 327 $aTechnical Session 1 -- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency -- On Seed-Incompressible Functions -- Technical Session 2 -- Asymptotically Efficient Lattice-Based Digital Signatures -- Basing Weak Public-Key Cryptography on Strong One-Way Functions -- Technical Session 3 -- Which Languages Have 4-Round Zero-Knowledge Proofs? -- How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge -- General Properties of Quantum Zero-Knowledge Proofs -- Technical Session 4 -- The Layered Games Framework for Specifications and Analysis of Security Protocols -- Universally Composable Multi-party Computation with an Unreliable Common Reference String -- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries -- Fast Private Norm Estimation and Heavy Hitters -- Technical Session 5 -- Matroids Can Be Far from Ideal Secret Sharing -- Perfectly-Secure MPC with Linear Communication Complexity -- MPC vs. SFE: Perfect Security in a Unified Corruption Model -- Invited Talk -- Bridging Game Theory and Cryptography: Recent Results and Future Directions -- Technical Session 6 -- Verifiably Secure Devices -- Lower Bounds on Implementing Robust and Resilient Mediators -- Cryptography and Game Theory: Designing Protocols for Exchanging Information -- Technical Session 7 -- Equivocal Blind Signatures and Adaptive UC-Security -- P-signatures and Noninteractive Anonymous Credentials -- Technical Session 8 -- Multi-property Preserving Combiners for Hash Functions -- OT-Combiners via Secure Computation -- Semi-honest to Malicious Oblivious Transfer?The Black-Box Way -- Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One -- Technical Session 9.-A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval -- Randomness Extraction Via ?-Biased Masking in the Presence of a Quantum Attacker -- Technical Session 10 -- An Equivalence Between Zero Knowledge and Commitments -- Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model -- Technical Session 11 -- The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization -- On Constant-Round Concurrent Zero-Knowledge -- Technical Session 12 -- Concurrent Non-malleable Commitments from Any One-Way Function -- Faster and Shorter Password-Authenticated Key Exchange -- Technical Session 13 -- Saving Private Randomness in One-Way Functions and Pseudorandom Generators -- Degradation and Amplification of Computational Hardness. 330 $aThis book constitutes the refereed proceedings of the Fifth Theory of Cryptography Conference, TCC 2008, held in New York, USA, March 19-21, 2008. The 33 revised full papers presented were carefully reviewed and selected from 81 submissions. The papers are organized in 16 sessions dealing with the paradigms, approaches and techniques used to conceptualize, define and provide solutions to natural cryptographic problems. 410 0$aSecurity and Cryptology,$x2946-1863 ;$v4948 606 $aCryptography 606 $aData encryption (Computer science) 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aData protection 606 $aElectronic data processing$xManagement 606 $aComputers and civilization 606 $aCryptology 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aData and Information Security 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$aData protection. 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$aData and Information Security. 615 24$aIT Operations. 615 24$aComputers and Society. 676 $a005.8 702 $aCanetti$b Ran 712 12$aTheory of Cryptography Conference 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910482979803321 996 $aTheory of Cryptography$93000229 997 $aUNINA