000 04933nam a22006615i 4500
001 978-3-642-00457-5
003 DE-He213
005 20240423125745.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 _a9783642004575
_9978-3-642-00457-5
024 7 _a10.1007/978-3-642-00457-5
_2doi
050 4 _aQA268
072 7 _aGPJ
_2bicssc
072 7 _aURY
_2bicssc
072 7 _aCOM083000
_2bisacsh
072 7 _aGPJ
_2thema
072 7 _aURY
_2thema
082 0 4 _a005.824
_223
245 1 0 _aTheory of Cryptography
_h[electronic resource] :
_bSixth Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009, Proceedings /
_cedited by Omer Reingold.
250 _a1st ed. 2009.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2009.
300 _aXI, 615 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aSecurity and Cryptology,
_x2946-1863 ;
_v5444
505 0 _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.
520 _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.
650 0 _aCryptography.
650 0 _aData encryption (Computer science).
650 0 _aAlgorithms.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aData protection.
650 0 _aElectronic data processing
_xManagement.
650 0 _aComputers and civilization.
650 1 4 _aCryptology.
650 2 4 _aAlgorithms.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aData and Information Security.
650 2 4 _aIT Operations.
650 2 4 _aComputers and Society.
700 1 _aReingold, Omer.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642004568
776 0 8 _iPrinted edition:
_z9783642004582
830 0 _aSecurity and Cryptology,
_x2946-1863 ;
_v5444
856 4 0 _uhttps://doi.org/10.1007/978-3-642-00457-5
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c181383
_d181383