787 search results - page 149 / 158 » Subversion-Resilient Signature Schemes |
CRYPTO
2006
Springer
15 years 1 months ago
2006
Springer
In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. H...
102
click to vote
EUROCRYPT
2006
Springer
15 years 1 months ago
2006
Springer
In this paper, we study the application of the function field sieve algorithm for computing discrete logarithms over finite fields of the form Fqn when q is a medium-sized prime po...
82
Voted
EUROCRYPT
2000
Springer
15 years 1 months ago
2000
Springer
We discuss the following problem: Given an integer shared secretly among n players and a prime number e, how can the players efficiently compute a sharing of e-1 mod . The most in...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In this paper, an efficiently DWT-based watermarking technique is proposed to embed signatures in images to attest the owner identification and discourage the unauthorized copying...
ENTCS
2008
14 years 9 months ago
2008
Verification of multi-threaded C++ programs poses three major challenges: the large number of states, states with huge sizes, and time intensive expansions of states. This paper p...