LEADER 04406nam 2200577Ia 450 001 9910483252603321 005 20200520144314.0 010 $a3-642-00457-1 024 7 $a10.1007/978-3-642-00457-5 035 $a(CKB)1000000000714677 035 $a(SSID)ssj0000320388 035 $a(PQKBManifestationID)11242692 035 $a(PQKBTitleCode)TC0000320388 035 $a(PQKBWorkID)10248963 035 $a(PQKB)11009741 035 $a(DE-He213)978-3-642-00457-5 035 $a(MiAaPQ)EBC3063937 035 $a(PPN)132874954 035 $a(EXLCZ)991000000000714677 100 $a20090126d2009 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aTheory of cryptography $e6th Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009 ; proceedings /$fOmer Reingold (ed.) 205 $a1st ed. 2009. 210 $aNew York ;$aBerlin $cSpringer$d2009 215 $a1 online resource (XI, 615 p.) 225 1 $aLecture notes in computer science ;$v5444 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-00456-3 320 $aIncludes bibliographical references and index. 327 $aAn Optimally Fair Coin Toss -- Complete Fairness in Multi-party Computation without an Honest Majority -- Fairness with an Honest Minority and a Rational Majority -- Purely Rational Secret Sharing (Extended Abstract) -- Some Recent Progress in Lattice-Based Cryptography -- Non-malleable Obfuscation -- Simulation-Based Concurrent Non-malleable Commitments and Decommitments -- Proofs of Retrievability via Hardness Amplification -- Security Amplification for Interactive Cryptographic Primitives -- Composability and On-Line Deniability of Authentication -- Authenticated Adversarial Routing -- Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer -- On the (Im)Possibility of Key Dependent Encryption -- On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols -- Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security -- Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation -- Realistic Failures in Secure Multi-party Computation -- Secure Arithmetic Computation with No Honest Majority -- Universally Composable Multiparty Computation with Partially Isolated Parties -- Oblivious Transfer from Weak Noisy Channels -- Composing Quantum Protocols in a Classical Environment -- LEGO for Two-Party Secure Computation -- Simple, Black-Box Constructions of Adaptively Secure Protocols -- Black-Box Constructions of Two-Party Protocols from One-Way Functions -- Chosen-Ciphertext Security via Correlated Products -- Hierarchical Identity Based Encryption with Polynomially Many Levels -- Predicate Privacy in Encryption Systems -- Simultaneous Hardcore Bits and Cryptography against Memory Attacks -- The Differential Privacy Frontier (Extended Abstract) -- How Efficient Can Memory Checking Be? -- Goldreich?s One-Way Function Candidate and Myopic Backtracking Algorithms -- Secret Sharing and Non-Shannon Information Inequalities -- Weak Verifiable Random Functions -- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection -- Towards a Theory of Extractable Functions. 330 $aThis book constitutes the refereed proceedings of the Sixth Theory of Cryptography Conference, TCC 2009, held in San Francisco, CA, USA, March 15-17, 2009. The 33 revised full papers presented together with two invited talks were carefully reviewed and selected from 109 submissions. The papers are organized in 10 sessions dealing with the paradigms, approaches and techniques used to conceptualize, define and provide solutions to natural cryptographic problems. 410 0$aLecture notes in computer science ;$v5444. 606 $aCryptography$vCongresses 606 $aComputer security$vCongresses 615 0$aCryptography 615 0$aComputer security 676 $a005.82 686 $aDAT 465f$2stub 686 $aSS 4800$2rvk 701 $aReingold$b Omer$01757796 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483252603321 996 $aTheory of cryptography$94195765 997 $aUNINA