Sciweavers

1769 search results - page 191 / 354
» Cryptography
Sort
View
115
Voted
PKC
2004
Springer
112views Cryptology» more  PKC 2004»
15 years 9 months ago
Identity-Based Threshold Decryption
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...
Joonsang Baek, Yuliang Zheng
156
Voted
PKC
2004
Springer
160views Cryptology» more  PKC 2004»
15 years 9 months ago
Constant Round Authenticated Group Key Agreement via Distributed Computation
Abstract. A group key agreement protocol allows a set of users, communicating over a public network, to agree on a private session key. Most of the schemes proposed so far require ...
Emmanuel Bresson, Dario Catalano
136
Voted
PKC
2004
Springer
150views Cryptology» more  PKC 2004»
15 years 9 months ago
Undeniable Signatures Based on Characters: How to Sign with One Bit
We present a new undeniable signature scheme which is based on the computation of characters. Our signature scheme offers the advantage of having an arbitrarily short signature. I...
Jean Monnerat, Serge Vaudenay
122
Voted
PKC
2004
Springer
95views Cryptology» more  PKC 2004»
15 years 9 months ago
A Nonuniform Algorithm for the Hidden Number Problem in Subgroups
Boneh and Venkatesan have proposed a polynomial time algorithm in a non-uniform model for recovering a ”hidden” element α ∈ IFp, where p is prime, from very short strings of...
Igor Shparlinski, Arne Winterhof
127
Voted
TCC
2004
Springer
100views Cryptology» more  TCC 2004»
15 years 9 months ago
On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes
In earlier work, we described a “pathological” example of a signature scheme that is secure in the Random Oracle Model, but for which no secure implementation exists. For that...
Ran Canetti, Oded Goldreich, Shai Halevi