Skip to search formSkip to main contentSkip to account menu

Adversary (cryptography)

Known as: Adversary 
In cryptography, an adversary (rarely opponent, enemy) is a malicious entity whose aim is to prevent the users of the cryptosystem from achieving… 
Wikipedia (opens in a new tab)

Related topics

Related topics

31 relations
Alice and BobAuthenticationBlock cipherCHAOS

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Programming the robot in tasks of inspection and interception
A pursuer ship - interceptor equipped with sonar, searches adversary submarine and it detected a submarine's periscope at a sea… 
Highly Cited
2012
Highly Cited
2012
Security improvement on an anonymous key agreement protocol based on chaotic maps
Highly Cited
2010
Highly Cited
2010
Privacy in dynamic social networks
Anonymization of social networks before they are published or shared has become an important research question. Recent work on… 
Highly Cited
2010
Highly Cited
2010
A Lightweight Stream Cipher WG-7 for RFID Encryption and Authentication
The family of WG stream ciphers has good randomness properties. In this paper, we parameterize WG-7 stream cipher for RFID tags… 
Highly Cited
2005
Highly Cited
2005
Information assurance in wireless sensor networks
Networking unattended wireless sensors is expected to have significant impact on the efficiency of a large array of military and… 
Highly Cited
2004
Highly Cited
2004
A steganographic scheme for secure communications based on the chaos and euler Theorem
Steganography has been proposed as a methodology for transmitting messages through innocuous covers to conceal their existence… 
Highly Cited
2004
Highly Cited
2004
A study of procurement behaviour in small firms
This paper analyses buyer‐supplier relationships from the perspective of small and medium‐sized enterprises (SMEs). Preliminary… 
Highly Cited
1987
Highly Cited
1987
Physical Security for the μABYSS System
Open systems, now common in many small computers, have given the user logical access to all parts of his or her system. At the… 
Highly Cited
1982
Highly Cited
1982
Adversary arguments and the logic of personal attacks
Highly Cited
1979
Highly Cited
1979
A Counting Approach to Lower Bounds for Selection Problems
Lower bounds are derived on the number of comparisons to solve several well-known selection problems Among the problems are… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)