Backdoor (computing)

Known as: W32/Induc-A, Trusting trust, Secure golden key 
A backdoor is a method, often secret, of bypassing normal authentication in a product, computer system, cryptosystem or algorithm etc. Backdoors are… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
Many security and software testing applications require checking whether certain properties of a program hold for any possible… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2017
2017
Consider sounds, say at 40kHz, that are completely outside the human's audible range (20kHz), as well as a microphone's… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2012
Highly Cited
2012
This paper is a short summary of the first real world detection of a backdoor in a military grade FPGA. Using an innovative… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Hardware components can contain hidden backdoors, which can be enabled with catastrophic effects or for ill-gotten profit. These… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
The surprisingly good performance of modern satisfiability (SAT) solvers is usually explained by the existence of a certain… (More)
  • figure 3
Is this relevant?
2007
2007
There has been considerable interest in the identification of structural properties of combinatorial problems that lead to… (More)
  • table 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We study the backbone and the backdoors of propositional satisfiability problems. We make a number of theoretical, algorithmic… (More)
  • table 1
  • table 3
  • table 2
Is this relevant?
2005
2005
We study the parameterized complexity of detecting small backdoor sets for instances of the propositional satisfiability problem… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We study the parameterized complexity of detecting backdoor sets for instances of the propositional satisfiability problem (SAT… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Modeling Modeling is not merely a process of behavioral mimicry. Highly functional patterns of behavior, which constitute the… (More)
Is this relevant?