Server-based signatures

In cryptography server-based signatures are digital signatures in which a publicly available server participates in the signature creation process… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1996-2016
01219962016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Functional encryption, as introduced by Boneh, Sahai, and Waters (TCC’11), generalizes public-key encryption systems to include… (More)
  • figure 1
  • figure 2
Is this relevant?
2014
2014
In this letter, a new method of identification of coherent scatterers (CSs) in the quadpolarimetric synthetic aperture radar (SAR… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
2014
2014
In the presented paper a new method of identification of canonical coherent scatterers in the quadpolarimetric SAR data are… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2013
2013
Certificateless signatures (CLSs) were introduced to solve the key escrow problem of identity-based signatures. In CLS, the full… (More)
  • table I
  • table II
  • table III
Is this relevant?
2008
2008
We consider a recently proposed scenario for the generation of primordial cosmological perturbations, the so called Cosmological… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2006
2006
In this letter, we analyze the performance of the minimum mean-square error (MMSE) detector for a code-division multiple-access… (More)
  • figure 1
  • figure 2
Is this relevant?
2004
2004
We present a method for the determination of upper limits on t he transverse velocity of the lensing galaxy in the quadruple… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We introduce chameleon signatures that provide with an undeniable commitment of the signer to the contents of the signed document… (More)
Is this relevant?
1996
1996
A speedup of Lenstra's Elliptic Curve Method of factorization is presented. The speedup works for integers of the form N = P Q 2… (More)
Is this relevant?