Publications of tcc 2004

Page	Title
1-20	Notions of Reducibility between Cryptographic Primitives
21-39	Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology
40-57	On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes
58-76	Universally Composable Commitments Using Random Oracles
77-100	Transformation of Digital Signature Schemes into Designated Confirmer Signature Schemes
101-120	List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument
121-132	On the Possibility of One-Message Weak Zero-Knowledge
133-151	Soundness of Formal Encryption in the Presence of Active Adversaries
152-170	Rerandomizable and Replayable Adaptive Chosen Ciphertext Attack Secure Cryptosystems
171-190	Alternatives to Non-malleability: Definitions, Constructions, and Applications (Extended Abstract)
191-202	A Note on Constant-Round Zero-Knowledge Proofs for NP
203-222	Lower Bounds for Concurrent Self Composition
223-237	Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation
238-257	A Quantitative Approach to Reductions in Secure Computation
258-277	Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering
278-296	Physically Observable Cryptography (Extended Abstract)
297-316	Efficient and Universally Composable Committed Oblivious Transfer and Applications
317-335	A Universally Composable Mix-Net
336-354	A General Composition Theorem for Secure Reactive Systems
355-373	Unfair Noisy Channels and Oblivious Transfer
374-393	Computational Collapse of Quantum State with Application to Oblivious Transfer
394-409	Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations
410-427	Composition of Random Systems: When Two Weak Make One Strong
428-445	Simpler Session-Key Generation from Short Random Passwords
446-472	Constant-Round Oblivious Transfer in the Bounded Storage Model
473-490	Hierarchical Threshold Secret Sharing
491-504	On Compressing Encrypted Data without the Encryption Key
505-521	On the Notion of Pseudo-Free Groups