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
2017
Highly Cited
2017
Unsupervised Video Summarization with Adversarial LSTM Networks
This paper addresses the problem of unsupervised video summarization, formulated as selecting a sparse subset of video frames… 
Highly Cited
2009
Highly Cited
2009
A secure dynamic ID based remote user authentication scheme for multi-server environment
Highly Cited
2009
Highly Cited
2009
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
We study the design of cryptographic primitives resilient to key-leakage attacks, where an attacker can repeatedly and adaptively… 
Highly Cited
2007
Highly Cited
2007
A randomized, efficient, and distributed protocol for the detection of node replication attacks in wireless sensor networks
Wireless sensor networks are often deployed in hostile environments, where anadversary can physically capture some of the nodes… 
Highly Cited
2005
Highly Cited
2005
A pairwise key predistribution scheme for wireless sensor networks
To achieve security in wireless sensor networks, it is important to be able to encrypt and authenticate messages sent between… 
Highly Cited
2005
Highly Cited
2005
Protecting Location Privacy Through Path Confusion
We present a path perturbation algorithm which can maximize users’ location privacy given a quality of service constraint. This… 
Highly Cited
2004
Highly Cited
2004
Source-location privacy in energy-constrained sensor network routing
As sensor-driven applications become increasingly integrated into our lives, issues related to sensor privacy will become… 
Highly Cited
2002
Highly Cited
2002
Shortest‐path network interdiction
We study the problem of interdicting the arcs in a network in order to maximize the shortest s–t path length. “Interdiction” is… 
Highly Cited
1998
Highly Cited
1998
Stochastic Network Interdiction
We describe discrete stochastic network interdiction of shortest-path, and maximum-reliability-path, networks. A nested “max–min… 
Highly Cited
1994
Highly Cited
1994
A Secure and Efficient Conference Key Distribution System (Extended Abstract)
We present practical conference key distribution systems based on public keys, which authenticate the users and which are ‘proven… 
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)