19 search results - page 4 / 4 » Threshold Signature Scheme without Using Polynomial Interpol... |
CORR
2006
Springer
13 years 4 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
CRYPTO
1994
Springer
13 years 9 months ago
1994
Springer
Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S...
SP
2007
IEEE
13 years 11 months ago
2007
IEEE
An electronic cash (e-cash) scheme lets a user withdraw money from a bank and then spend it anonymously. E-cash can be used only if it can be securely and fairly exchanged for ele...
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...