000 04457nam a22006495i 4500
001 978-3-540-70936-7
003 DE-He213
005 20240730182007.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 _a9783540709367
_9978-3-540-70936-7
024 7 _a10.1007/978-3-540-70936-7
_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] :
_b4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands, February 21-24, 2007, Proceedings /
_cedited by Salil P. Vadhan.
250 _a1st ed. 2007.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2007.
300 _aXI, 595 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 ;
_v4392
505 0 _aEncryption I -- Does Privacy Require True Randomness? -- Tackling Adaptive Corruptions in Multicast Encryption Protocols -- Universally Composable Security -- Long-Term Security and Universal Composability -- Universally Composable Security with Global Setup -- Arguments and Zero Knowledge -- Parallel Repetition of Computationally Sound Protocols Revisited -- Lower Bounds for Non-interactive Zero-Knowledge -- Perfect NIZK with Adaptive Soundness -- Notions of Security -- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries -- On the Necessity of Rewinding in Secure Multiparty Computation -- On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits -- Obfuscation -- On Best-Possible Obfuscation -- Obfuscation for Cryptographic Purposes -- Securely Obfuscating Re-encryption -- Secret Sharing and Multiparty Computation -- Weakly-Private Secret Sharing Schemes -- On Secret Sharing Schemes, Matroids and Polymatroids -- Secure Linear Algebra Using Linearly Recurrent Sequences -- Towards Optimal and Efficient Perfectly Secure Message Transmission -- Signatures and Watermarking -- Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions -- Designated Confirmer Signatures Revisited -- From Weak to Strong Watermarking -- Private Approximation and Black-Box Reductions -- Private Approximation of Clustering and Vertex Cover -- Robuster Combiners for Oblivious Transfer -- One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments -- Towards a Separation of Semantic and CCA Security for Public Key Encryption -- Key Establishment -- Unifying Classical and Quantum Key Distillation -- Intrusion-Resilient Key Exchange in the Bounded Retrieval Model -- (Password) Authenticated Key Establishment:From 2-Party to Group -- Encryption II -- Multi-authority Attribute Based Encryption -- Conjunctive, Subset, and Range Queries on Encrypted Data -- How to Shuffle in Public -- Evaluating Branching Programs on Encrypted Data.
650 0 _aCryptography.
_91973
650 0 _aData encryption (Computer science).
_99168
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aData protection.
_97245
650 0 _aElectronic data processing
_xManagement.
_9126894
650 0 _aComputers and civilization.
_921733
650 1 4 _aCryptology.
_931769
650 2 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aData and Information Security.
_931990
650 2 4 _aIT Operations.
_931703
650 2 4 _aComputers and Society.
_931668
700 1 _aVadhan, Salil P.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9126895
710 2 _aSpringerLink (Online service)
_9126896
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540709350
776 0 8 _iPrinted edition:
_z9783540835516
830 0 _aSecurity and Cryptology,
_x2946-1863 ;
_v4392
_9126897
856 4 0 _uhttps://doi.org/10.1007/978-3-540-70936-7
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c91177
_d91177