000 04064nam a22006255i 4500
001 978-3-540-24638-1
003 DE-He213
005 20240423125653.0
007 cr nn 008mamaa
008 121227s2004 gw | s |||| 0|eng d
020 _a9783540246381
_9978-3-540-24638-1
024 7 _a10.1007/b95566
_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] :
_bFirst Theory of Cryptography Conference, TCC 2004, Cambridge, MA, USA, February 19-21, 2004, Proceedings /
_cedited by Moni Naor.
250 _a1st ed. 2004.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2004.
300 _aXII, 532 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2951
505 0 _aNotions of Reducibility between Cryptographic Primitives -- Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology -- On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes -- Universally Composable Commitments Using Random Oracles -- Transformation of Digital Signature Schemes into Designated Confirmer Signature Schemes -- List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument -- On the Possibility of One-Message Weak Zero-Knowledge -- Soundness of Formal Encryption in the Presence of Active Adversaries -- Rerandomizable and Replayable Adaptive Chosen Ciphertext Attack Secure Cryptosystems -- Alternatives to Non-malleability: Definitions, Constructions, and Applications -- A Note on Constant-Round Zero-Knowledge Proofs for NP -- Lower Bounds for Concurrent Self Composition -- Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation -- A Quantitative Approach to Reductions in Secure Computation -- Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering -- Physically Observable Cryptography -- Efficient and Universally Composable Committed Oblivious Transfer and Applications -- A Universally Composable Mix-Net -- A General Composition Theorem for Secure Reactive Systems -- Unfair Noisy Channels and Oblivious Transfer -- Computational Collapse of Quantum State with Application to Oblivious Transfer -- Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations -- Composition of Random Systems: When Two Weak Make One Strong -- Simpler Session-Key Generation from Short Random Passwords -- Constant-Round Oblivious Transfer in the Bounded Storage Model -- Hierarchical Threshold Secret Sharing -- On Compressing Encrypted Data without the Encryption Key -- On the Notion of Pseudo-Free Groups.
650 0 _aCryptography.
650 0 _aData encryption (Computer science).
650 0 _aOperating systems (Computers).
650 0 _aAlgorithms.
650 0 _aComputers and civilization.
650 0 _aElectronic data processing
_xManagement.
650 1 4 _aCryptology.
650 2 4 _aOperating Systems.
650 2 4 _aAlgorithms.
650 2 4 _aComputers and Society.
650 2 4 _aIT Operations.
700 1 _aNaor, Moni.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540210009
776 0 8 _iPrinted edition:
_z9783662209912
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2951
856 4 0 _uhttps://doi.org/10.1007/b95566
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c180471
_d180471