Sciweavers

18 search results - page 4 / 4
» Threshold Undeniable RSA Signature Scheme
Sort
View
PKC
2005
Springer
93views Cryptology» more  PKC 2005»
13 years 10 months ago
Optimizing Robustness While Generating Shared Secret Safe Primes
We develop a method for generating shared, secret, safe primes applicable to use in threshold RSA signature schemes such as the one developed by Shoup. We would like a scheme usabl...
Emil Ong, John Kubiatowicz
EUROCRYPT
2000
Springer
13 years 8 months ago
Computing Inverses over a Shared Secret Modulus
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...
Dario Catalano, Rosario Gennaro, Shai Halevi
SPW
2004
Springer
13 years 10 months ago
The Dancing Bear: A New Way of Composing Ciphers
This note presents a new way of composing cryptographic primitives which makes some novel combinations possible. For example, one can do threshold decryption using standard block c...
Ross Anderson