Formalizing human ignorance

DOI10.1007/11958239_14MaRDI QIDQ2876977zbMATH OpenOpenAlexFDO

Authors Phillip Rogaway

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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Limits of Constructive Security Proofs
• scientific article; zbMATH DE number 1303133
• On the complexity of collision resistant hash functions: new and old black-box separations
• Some observations on the theory of cryptographic hash functions
• scientific article; zbMATH DE number 177052

Cited in

(39)

• Domain extender for collision resistant hash functions: Improving upon Merkle-Damgård iteration
• One-message zero knowledge and non-malleable commitments
• Short variable length domain extenders with beyond birthday bound security
• Random oracles and non-uniformity
• State separation for code-based game-playing proofs
• A cryptographic analysis of the TLS 1.3 handshake protocol
• On the tight security of TLS 1.3: theoretically sound cryptographic parameters for real-world deployments
• Lattice-based blind signatures, revisited
• Critique of the related-key attack concept
• Ignorance of ignorance
• Concurrent knowledge extraction in public-key models
• Balloon hashing: a memory-hard function providing provable protection against sequential attacks
• The symbiosis between collision and preimage resistance
• 3-message zero knowledge against human ignorance
• Designing proof of human-work puzzles for cryptocurrency and beyond
• Proofs of space
• Preimage Attacks on Step-Reduced MD5
• MD4 is Not One-Way
• 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
• A Three-Property-Secure Hash Function
• Interpreting hash function security proofs
• Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
• Fixing cracks in the concrete: random oracles with auxiliary input, revisited
• How to Use Merkle-Damgård — On the Security Relations between Signature Schemes and Their Inner Hash Functions
• Session resumption protocols and efficient forward security for TLS 1.3 0-RTT
• On committing authenticated-encryption
• The query-complexity of preprocessing attacks
• When messages are keys: is HMAC a dual-PRF?
• Universal reductions: reductions relative to stateful oracles
• Symmetric and dual PRFs from standard assumptions: a generic validation of a prevailing assumption
• Schnorr signatures are tightly secure in the ROM under a non-interactive assumption
• Quantum money from abelian group actions
• Buffing threshold signature schemes
• Security analysis of Signal's \textsf{PQXDH} handshake
• Improving tightness gap of GGM construction and its applications
• Compact, efficient and non-separable hybrid signatures
• Lower bound on number of compression calls of a collision-resistance preserving hash

This page was built for publication: Formalizing human ignorance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2876977)