2489 search results - page 3 / 498 » On the Subgroup Distance Problem |
75
Voted
PKC
2004
Springer
15 years 2 months ago
2004
Springer
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...
77
Voted
ASIACRYPT
2005
Springer
15 years 3 months ago
2005
Springer
We introduce a new cryptographic primitive called the blind coupon mechanism (BCM). In effect, the BCM is an authenticated bit commitment scheme, which is AND-homomorphic. It has n...
ACISP
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
STOC
2001
ACM
15 years 9 months ago
2001
ACM
COMCOM
2006
14 years 9 months ago
2006
In the paper, we consider a preference heterogeneity problem in large-scale multicast applications. Abundant content, data type and diverse members' interests naturally lead ...