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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1954-2017
0500100019542016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Cryptography Ueli Maurer Renato Renner Department of Computer Science, ETH Zurich, Switzerland Institute for Theoretical Physics… (More)
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We say that a cryptographic scheme is Continuous Leakage-Resilient (CLR), if it allows users to refresh their secret keys, using… (More)
  • figure 10
  • figure 14
Is this relevant?
Highly Cited
2009
Highly Cited
2009
This paper considers two questions in cryptography. Cryptography Secure Against Memory Attacks. A particularly devastating side… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Network coding substantially increases network throughput. But since it involves mixing of information inside the network, a… (More)
  • figure 1
  • table I
  • table II
Is this relevant?
Highly Cited
2007
Highly Cited
2007
In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
This paper introduces the concept of certificateless public key cryptography (CL-PKC).<lb>In contrast to traditional public key… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Recent research has considered DNA as a medium for ultra-scale computation and for ultracompact information storage. One… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The goal of this paper is to introduce a simple verifiable secret sharing scheme, and to improve the efficiency of known secure… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
1990
Highly Cited
1990
We describe results from an apparatus and protocol designed to implement quantum key distribution, by which two users, who share… (More)
  • figure 1
Is this relevant?