Sciweavers

18 search results - page 2 / 4
» pkc 2004
Sort
View
PKC
2004
Springer
102views Cryptology» more  PKC 2004»
13 years 10 months ago
Cryptographic Randomized Response Techniques
Abstract. We develop cryptographically secure techniques to guarantee unconditional privacy for respondents to polls. Our constructions are efficient and practical, and are shown ...
Andris Ambainis, Markus Jakobsson, Helger Lipmaa
PKC
2004
Springer
146views Cryptology» more  PKC 2004»
13 years 10 months ago
Constructing Committed Signatures from Strong-RSA Assumption in the Standard Complexity Model
Abstract. In this paper, we provide the first committed signature provably secure in the standard complexity model based on the strong RSA assumption. The idea behind the construc...
Huafei Zhu
PKC
2004
Springer
150views Cryptology» more  PKC 2004»
13 years 10 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
PKC
2004
Springer
160views Cryptology» more  PKC 2004»
13 years 10 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
PKC
2004
Springer
95views Cryptology» more  PKC 2004»
13 years 10 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