1401 search results - page 133 / 281 » Randomness in Interactive Proofs |
PKC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper, we examine issues related to the construction of identity-based threshold decryption schemes and argue that it is important in practice to design an identi...
SACRYPT
2004
Springer
15 years 3 months ago
2004
Springer
Addition-subtraction-chains obtained from signed digit recodings of integers are a common tool for computing multiples of random elements of a group where the computation of invers...
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
We work with an extension of Resolution, called Res(2), that allows clauses with conjunctions of two literals. In this system there are rules to introduce and eliminate such conju...
CRYPTO
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. The Full Domain Hash (FDH) scheme is a RSA-based signature scheme in which the message is hashed onto the full domain of the RSA function. The FDH scheme is provably secu...
CRYPTO
1989
Springer
15 years 2 months ago
1989
Springer
Abstract. In this paper, we provide a new approach to study undeniable signatures by translating secure digital signatures to secure undeniable signatures so that the existing algo...