On related-secret pseudorandomness
From MaRDI portal
Publication:3408199
DOI10.1007/978-3-642-11799-2_16zbMATH Open1274.94070OpenAlexW1758603164MaRDI QIDQ3408199FDOQ3408199
Authors: David Goldenberg, Moses Liskov 
Publication date: 24 February 2010
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11799-2_16
Recommendations
- Fast Software Encryption
- scientific article; zbMATH DE number 2009976
- Pseudorandom functions and permutations provably secure against related-key attacks
- Related-key security for pseudorandom functions beyond the linear barrier
- Related-key security for pseudorandom functions beyond the linear barrier
Cites Work
- Simultaneous Hardcore Bits and Cryptography against Memory Attacks
- A Pseudorandom Generator from any One-way Function
- Title not available (Why is that?)
- Fast Software Encryption
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Breaking RSA may not be equivalent to factoring
- Distinguisher and Related-Key Attack on the Full AES-256
- Title not available (Why is that?)
- New types of cryptanalytic attacks using related keys
- On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
- Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets
- Cryptography and Coding
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- Related-Key Differential-Linear Attacks on Reduced AES-192
- Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
- An Improved Robust Fuzzy Extractor
- Title not available (Why is that?)
- New Related-Key Boomerang Attacks on AES
Cited In (17)
- Title not available (Why is that?)
- Subversion-resilient signatures: definitions, constructions and applications
- Secure message authentication against related-key attack
- The related-key analysis of Feistel constructions
- On the Security of Pseudorandomized Information-Theoretically Secure Schemes
- Clever arbiters versus malicious adversaries. On the gap between known-input security and chosen-input security
- Efficient public-key cryptography with bounded leakage and tamper resilience
- Naor-Reingold goes public: the complexity of known-key security
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Related-key security for pseudorandom functions beyond the linear barrier
- Fast Software Encryption
- Related-key secure key encapsulation from extended computational bilinear Diffie-Hellman
- Pseudorandom functions and permutations provably secure against related-key attacks
- On cipher-dependent related-key attacks in the ideal-cipher model
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Non-malleable Codes with Split-State Refresh
- Non-malleable functions and their applications
This page was built for publication: On related-secret pseudorandomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3408199)
