Pages that link to "Item:Q5451014"
From MaRDI portal
The following pages link to Advances in Cryptology – CRYPTO 2005 (Q5451014):
Displayed 33 items.
- Efficient Collision Search Attacks on SHA-0 (Q5451015) (← links)
- Finding Collisions in the Full SHA-1 (Q5451016) (← links)
- Pebbling and Proofs of Work (Q5451017) (← links)
- Composition Does Not Imply Adaptive Security (Q5451018) (← links)
- On the Discrete Logarithm Problem on Algebraic Tori (Q5451019) (← links)
- A Practical Attack on a Braid Group Based Cryptographic Protocol (Q5451020) (← links)
- The Conditional Correlation Attack: A Practical Attack on Bluetooth Encryption (Q5451021) (← links)
- Unconditional Characterizations of Non-interactive Zero-Knowledge (Q5451022) (← links)
- Impossibility and Feasibility Results for Zero Knowledge with Public Keys (Q5451023) (← links)
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors (Q5451024) (← links)
- A Formal Treatment of Onion Routing (Q5451025) (← links)
- Simple and Efficient Shuffling with Provable Correctness and ZK Privacy (Q5451026) (← links)
- Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions (Q5451027) (← links)
- Private Searching on Streaming Data (Q5451028) (← links)
- Privacy-Preserving Set Operations (Q5451029) (← links)
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys (Q5451030) (← links)
- Generic Transformation for Scalable Broadcast Encryption Schemes (Q5451031) (← links)
- Authenticating Pervasive Devices with Human Protocols (Q5451032) (← links)
- Secure Communications over Insecure Channels Based on Short Authenticated Strings (Q5451033) (← links)
- On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes (Q5451034) (← links)
- Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields (Q5451035) (← links)
- Secure Computation Without Authentication (Q5451036) (← links)
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator (Q5451037) (← links)
- Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems (Q5451038) (← links)
- Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes (Q5451039) (← links)
- Merkle-Damgård Revisited: How to Construct a Hash Function (Q5451041) (← links)
- On the Generic Insecurity of the Full Domain Hash (Q5451042) (← links)
- New Monotones and Lower Bounds in Unconditional Two-Party Computation (Q5451043) (← links)
- One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption (Q5451044) (← links)
- A Quantum Cipher with Near Optimal Key-Recycling (Q5451045) (← links)
- An Efficient CDH-Based Signature Scheme with a Tight Security Reduction (Q5451046) (← links)
- Improved Security Analyses for CBC MACs (Q5451047) (← links)
- HMQV: A High-Performance Secure Diffie-Hellman Protocol (Q5451048) (← links)