2015 · 90 citations · 2 references
ComputingComputer ScienceCybersecurityComputer SecurityCryptographySecurity ArchitectureClassical CryptographyCryptographic AlgorithmsInformation-theoretic CryptographyCryptanalysisEncryptionInjectivitySymmetric-key Encryption
We present new algorithm-substitution attacks (ASAs) on symmetric encryption that improve over prior ones in two ways. First, while prior attacks only broke a sub-class of randomized schemes having a property called coin injectivity, our attacks break ALL randomized schemes. Second, while prior attacks are stateful, ours are stateless, achieving a notion of strong undetectability that we formalize. Together this shows that ASAs are an even more dangerous and powerful mass surveillance method than previously thought. Our work serves to increase awareness about what is possible with ASAs and to spur the search for deterrents and counter-measures.
2
How to construct random functions
Oded Goldreich, Shafi Goldwasser, Silvio Micali · Journal of the ACM · 1986 · 2.1K citations · Full text
Subversion-Resilient Signature Schemes
Giuseppe Ateniese, Bernardo Magri, Daniele Venturi · 2015 · 112 citations · Full text