Jump to content

Cryptovirology: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
m This logo is still idiosyncratic.
Moti and I feel that this art is representative of our work. Anyone that feels strongly against it being on this page is encouraged to email us at feedback@cryptovirology.com
Line 1: Line 1:
{{dablink|See also: the biological [[cryptovirus]]}}
{{dablink|See also: the biological [[cryptovirus]]}}

[[Image:Cryptovline.PNG|thumb|right|Cryptovirology]]


'''Cryptovirology''' is a field that studies how to use [[cryptography]] to design powerful [[malware|malicious software]]. It encompasses overt attacks such as cryptoviral extortion where
'''Cryptovirology''' is a field that studies how to use [[cryptography]] to design powerful [[malware|malicious software]]. It encompasses overt attacks such as cryptoviral extortion where

Revision as of 15:49, 8 April 2007

File:Cryptovline.PNG
Cryptovirology

Cryptovirology is a field that studies how to use cryptography to design powerful malicious software. It encompasses overt attacks such as cryptoviral extortion where a cryptovirus, cryptoworm, or cryptotrojan hybrid encrypts the victim's files and the user must pay the malware author to receive the needed session key (that is encrypted under the author's public key that is contained in the malware).

The field also encompasses covert attacks in which the attacker secretly steals private information such as private keys. An example of the latter type of attack are asymmetric backdoors. An asymmetric backdoor is a backdoor (e.g., in a cryptosystem) that can only be used by the attacker even after it is found. This contrasts with the traditional backdoor that is symmetric, i.e., anyone that finds it can use it. Kleptography, a subfield of Cryptovirology, is concerned with the study of asymmetric backdoors in key generation algorithms, digital signature algorithms, key exchanges, and so on.

Cryptovirology also encompasses the notion of a "questionable encryption scheme" which was introduced by Young and Yung. Informally speaking, a questionable encryption scheme is a public key cryptosystem (3-tuple of algorithms) with two supplementary algorithms, forming a 5-tuple of algorithms. It includes a deliberately bogus yet carefully designed key pair generation algorithm that produces a "fake" public key. The corresponding private key cannot be used to decipher data "encrypted" using the fake public key. By supplying the key pair to an efficient verification predicate (the 5th algorithm in the 5-tuple) it is proven whether the public key is real or fake. When the public key is fake it follows that no one can decipher data "enciphered" using the fake public key (this includes the person that generated the key pair). A questionable encryption scheme has the property that real public keys are computationally indistinguishable from fake public keys when the private key is not available. The private key forms a poly-sized witness of encryption or decryption, whichever may be the case.

An application of a questionable encryption scheme is a cryptotrojan that gathers plaintext from the host, "encrypts" it using the public key (which is real or fake) of the cryptotrojan and then exfiltrates the resulting "ciphertext". In this attack it is thoroughly intractable to prove that data theft has occurred. This holds even when all core dumps of the cryptotrojan and all covert information that it secretly broadcasts is entered into evidence. An analyst that jumps to the conclusion that the cryptotrojan "encrypts" data risks being proven wrong by the malware author (e.g., anonymously).

When the public key is fake the attacker gets no plaintext from the cryptotrojan. So what's the use? A spoofing attack is possible in which some cryptotrojans steal data and some provably do not, thereby casting doubt on the true nature of future strains of cryptotrojans, cryptoviruses, and cryptoworms. This attack implies a fundamental limitation on proving data theft.

There are many other attacks in the field of cryptovirology that are not mentioned here.

References

  • A. Young, M. Yung. "Cryptovirology: Extortion-Based Security Threats and Countermeasures". IEEE Symposium on Security & Privacy, May 6-8, 1996. pp. 129–141. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help) [1]
  • A. Young, M. Yung (1996). "The Dark Side of Black-Box Cryptography, or: Should we trust Capstone?". In Neal Koblitz (ed.). Proceedings of Crypto '96. Springer-Verlag. pp. 89–103. LNCS 1109. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help)
  • A. Young, M. Yung (1997). "Kleptography: Using Cryptography Against Cryptography". In W. Fumy (ed.). Proceedings of Eurocrypt '97. Springer-Verlag. pp. 62–74. LNCS 1233. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help)
  • A. Young, M. Yung (2004). Malicious Cryptography: Exposing Cryptovirology. Wiley. ISBN 0-7645-4975-8.
  • A. Young, M. Yung (2006). "On Fundamental Limitations of Proving Data Theft". IEEE Transactions on Information Forensics and Security, 1(4). pp. 524–531. {{cite conference}}: Cite has empty unknown parameter: |1= (help); Unknown parameter |booktitle= ignored (|book-title= suggested) (help) [2]