Academic
Publications
On Fundamental Limitations of Proving Data Theft

On Fundamental Limitations of Proving Data Theft,10.1109/TIFS.2006.885025,IEEE Transactions on Information Forensics and Security,Adam L. Young,Moti M

On Fundamental Limitations of Proving Data Theft   (Citations: 2)
BibTex | RIS | RefWorks Download
We show software agents that operate on input plaintext, transmit the result, and have the property that characterizes the operation as theft of plaintext amounts to solving a hard cryptographic problem. Such agents employ what we call a "questionable encryption scheme" in which it is computationally intractable to determine if the output is an asymmetric ciphertext or nonce. We therefore show a fundamental computational limitation of information forensics
Journal: IEEE Transactions on Information Forensics and Security , vol. 1, no. 4, pp. 524-531, 2006
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...Complex attacks leaving larger footprint such as network congestion, disruption, jamming, spamming and altering data values tackled in [18] [19] are easier to detect than data theft which is harder to detect as proven even by forensic analysis for carefully designed malicious software [20]...

    Mukesh Jagasiaet al. Distributed Data-Theft Detection in Wireless Sensor Networks

    • ...In this chapter we present an implementation of the perfect questionable encryption scheme that appears in [9] that is based on our MyCrypt ’05 paper [11]...
    • ...scheme that will appear in IEEE Transactions on Information Forensics and Security [9]...
    • ...This chapter goes beyond [9] by showing how to implement perfect questionable encryptions in a very computationally ecient manner...
    • ...Command (c) executes function F as defined in [9]...

    Adam L. Younget al. Chapter 4: Implementing Perfect Questionable Encryptions

Sort by: