LEADER 05962nam 22008295 450 001 996465886203316 005 20200706100137.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 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aTheory of Cryptography$b[electronic resource] $eSixth Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009, Proceedings /$fedited by Omer Reingold 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (XI, 615 p.) 225 1 $aSecurity and Cryptology ;$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$aSecurity and Cryptology ;$v5444 606 $aData encryption (Computer science) 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aComputer security 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 $aSystems and Data Security$3https://scigraph.springernature.com/ontologies/product-market-codes/I28060 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 608 $aKongress.$2swd 608 $aSan Francisco (Calif., 2009)$2swd 615 0$aData encryption (Computer science). 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aComputer security. 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$aSystems and Data Security. 615 24$aManagement of Computing and Information Systems. 615 24$aComputers and Society. 676 $a005.82 686 $aDAT 465f$2stub 686 $aSS 4800$2rvk 702 $aReingold$b Omer$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465886203316 996 $aTheory of Cryptography$9772206 997 $aUNISA