On the Impossibility of Cryptography with Tamperable Randomness
- 5 October 2016
- journal article
- research article
- Published by Springer Science and Business Media LLC in Algorithmica
- Vol. 79 (4), 1052-1101
- https://doi.org/10.1007/s00453-016-0219-7
Abstract
No abstract availableKeywords
Funding Information
- Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada
- Division of Computer and Network Systems (1217821)
- Division of Computing and Communication Foundations (1350939)
- Alfred P. Sloan Foundation
- Microsoft New Faculty Fellowship
- Division of Computer and Network Systems (1217821)
- Division of Computing and Communication Foundations (0746990, 1214844)
- AFOSR YIP (FA9550-10-1-0093)
- Defense Advanced Research Projects Agency
- Air Force Research Laboratory (FA8750-11-2- 0211.)
This publication has 32 references indexed in Scilit:
- How to Encrypt with a Malicious Random Number GeneratorLecture Notes in Computer Science, 2008
- Beyond stack smashing: recent advances in exploiting buffer overrunsIEEE Security & Privacy, 2004
- Physically Observable CryptographyLecture Notes in Computer Science, 2004
- Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware TamperingLecture Notes in Computer Science, 2004
- A Pseudorandom Generator from any One-way FunctionSIAM Journal on Computing, 1999
- Differential fault analysis of secret key cryptosystemsLecture Notes in Computer Science, 1997
- Definitions and properties of zero-knowledge proof systemsJournal of Cryptology, 1994
- Generating quasi-random sequences from semi-random sourcesJournal of Computer and System Sciences, 1986
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978