Clever arbiters versus malicious adversaries. On the gap between known-input security and chosen-input security

DOI10.1007/978-3-662-49301-4_31MaRDI QIDQ2803661zbMATH OpenOpenAlexFDO

Authors Serge Vaudenay

Publication date 2 May 2016

Published in The New Codebreakers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-49301-4_31

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On related-secret pseudorandomness
• On cipher-dependent related-key attacks in the ideal-cipher model
• Fast Software Encryption
• Cryptography secure against related-key attacks and tampering
• scientific article; zbMATH DE number 2009976

Cites work

• scientific article; zbMATH DE number 176554 (Why is no real title available?)
• scientific article; zbMATH DE number 1024009 (Why is no real title available?)
• scientific article; zbMATH DE number 1951605 (Why is no real title available?)
• scientific article; zbMATH DE number 1951616 (Why is no real title available?)
• scientific article; zbMATH DE number 2009976 (Why is no real title available?)
• scientific article; zbMATH DE number 1842483 (Why is no real title available?)
• scientific article; zbMATH DE number 1394311 (Why is no real title available?)
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A white-box DES implementation for DRM applications
• Composition Implies Adaptive Security in Minicrypt
• Critique of the related-key attack concept
• Fast Software Encryption
• How to decrypt or even substitute DES-encrypted messages in \(2^{28}\) steps.
• New directions in cryptography
• New types of cryptanalytic attacks using related keys
• Nonmalleable Cryptography
• Obfuscation for Cryptographic Purposes
• On cipher-dependent related-key attacks in the ideal-cipher model
• On related-secret pseudorandomness
• On the (Im)Possibility of Key Dependent Encryption
• Probability Inequalities for Sums of Bounded Random Variables
• Pseudorandom functions and permutations provably secure against related-key attacks

Cited in

(1)

• On the related-key attack security of authenticated encryption schemes

This page was built for publication: Clever arbiters versus malicious adversaries. On the gap between known-input security and chosen-input security

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