Title :
On Fundamental Limitations of Proving Data Theft
Author :
Young, Adam L. ; Yung, Moti M.
Author_Institution :
Cryptovirology Labs., Sterling, VA
Abstract :
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
Keywords :
cryptography; software agents; asymmetric ciphertext; cryptographic problem; data theft proving; information forensics; input plaintext; questionable encryption scheme; software agents; Application software; Data security; Failure analysis; Forensics; Information security; Public key; Public key cryptography; Software agents; Software design; All-or-nothing disclosure; decision $n$th degree composite residuosity; paillier cryptosystem; public key cryptosystem (PKCS); questionable encryption; semantic security;
Journal_Title :
Information Forensics and Security, IEEE Transactions on
DOI :
10.1109/TIFS.2006.885025
