Formalizing Human Ignorance
From MaRDI portal
Publication:2876977
DOI10.1007/11958239_14zbMath1295.94138OpenAlexW1512498994MaRDI QIDQ2876977
Publication date: 21 August 2014
Published in: Progress in Cryptology - VIETCRYPT 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11958239_14
Related Items
Concurrent knowledge extraction in public-key models, One-message zero knowledge and non-malleable commitments, Short variable length domain extenders with beyond birthday bound security, 3-Message Zero Knowledge Against Human Ignorance, Proofs of Space, Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond, Random oracles and non-uniformity, On committing authenticated-encryption, Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks, The query-complexity of preprocessing attacks, When messages are keys: is HMAC a dual-PRF?, Preimage Attacks on Step-Reduced MD5, Universal reductions: reductions relative to stateful oracles, Critique of the related-key attack concept, Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles, MD4 is Not One-Way, State separation for code-based game-playing proofs, A cryptographic analysis of the TLS 1.3 handshake protocol, Interpreting Hash Function Security Proofs, Compression from Collisions, or Why CRHF Combiners Have a Long Output, How to Fill Up Merkle-Damgård Hash Functions, Limits of Constructive Security Proofs, Session resumption protocols and efficient forward security for TLS 1.3 0-RTT, On the tight security of TLS 1.3: theoretically sound cryptographic parameters for real-world deployments, A Three-Property-Secure Hash Function, A Mathematical Problem for Security Analysis of Hash Functions and Pseudorandom Generators, Domain extender for collision resistant hash functions: Improving upon Merkle-Damgård iteration, The Symbiosis between Collision and Preimage Resistance, How to Use Merkle-Damgård — On the Security Relations between Signature Schemes and Their Inner Hash Functions, Lattice-based blind signatures, revisited, Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited
