|
|
|
|
| LEADER |
03178nmm a2200361 u 4500 |
| 001 |
EB000652135 |
| 003 |
EBX01000000000000001348857 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540246381
|
| 100 |
1 |
|
|a Naor, Moni
|e [editor]
|
| 245 |
0 |
0 |
|a Theory of Cryptography
|h Elektronische Ressource
|b First Theory of Cryptography Conference, TCC 2004, Cambridge, MA, USA, February 19-21, 2004, Proceedings
|c edited by Moni Naor
|
| 250 |
|
|
|a 1st ed. 2004
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2004, 2004
|
| 300 |
|
|
|a XII, 532 p
|b online resource
|
| 505 |
0 |
|
|a Notions 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
|
| 653 |
|
|
|a Computers and Society
|
| 653 |
|
|
|a Operating Systems
|
| 653 |
|
|
|a Operating systems (Computers)
|
| 653 |
|
|
|a Cryptography
|
| 653 |
|
|
|a Electronic data processing / Management
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Data encryption (Computer science)
|
| 653 |
|
|
|a Cryptology
|
| 653 |
|
|
|a IT Operations
|
| 653 |
|
|
|a Computers and civilization
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/b95566
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/b95566?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 005.824
|