LEADER 04042nam 2200625 450 001 996465613303316 005 20220420175522.0 010 $a1-280-90219-1 010 $a9786610902194 010 $a3-540-70936-3 024 7 $a10.1007/978-3-540-70936-7 035 $a(CKB)1000000000284154 035 $a(SSID)ssj0000311381 035 $a(PQKBManifestationID)11276373 035 $a(PQKBTitleCode)TC0000311381 035 $a(PQKBWorkID)10328625 035 $a(PQKB)10083523 035 $a(DE-He213)978-3-540-70936-7 035 $a(MiAaPQ)EBC3036660 035 $a(MiAaPQ)EBC6693534 035 $a(Au-PeEL)EBL6693534 035 $a(PPN)123160359 035 $a(EXLCZ)991000000000284154 100 $a20220420d2007 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aTheory of cryptography $e4th Theory of Cryptography Conference, TCC 2007, Amsterdam, the Netherlands, February 21-24, 2007 : proceedings /$fSalil Vadhan 205 $a1st ed. 2007. 210 1$aBerlin :$cSpringer,$d[2007] 210 4$dİ2007 215 $a1 online resource (XI, 595 p.) 225 1 $aLecture Notes in Computer Science ;$vVolume 4392 300 $a"International Association for Cryptologic Research"--Logo on cover. 311 $a3-540-70935-5 320 $aIncludes bibliographical references and index. 327 $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. 410 0$aLecture notes in computer science ;$vVolume 4392. 606 $aCryptography$vCongresses 606 $aComputer security$vCongresses 615 0$aCryptography 615 0$aComputer security 676 $a005.8 700 $aVadhan$b Salil$01221976 701 $aVadhan$b Salil$01221976 712 02$aInternational Association for Cryptologic Research. 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465613303316 996 $aTheory of cryptography$92833843 997 $aUNISA