Sciweavers

3628 search results - page 4 / 726
» The Decision Diffie-Hellman Problem
Sort
View
ANTS
2006
Springer
78views Algorithms» more  ANTS 2006»
13 years 11 months ago
Hidden Pairings and Trapdoor DDH Groups
This paper suggests a new building block for cryptographic protocols and gives two instantiations of it. The concept is to generate two descriptions of the same group: a public des...
Alexander W. Dent, Steven D. Galbraith
ESORICS
2010
Springer
13 years 8 months ago
Efficient Multi-dimensional Key Management in Broadcast Services
The prevalent nature of Internet makes it a well suitable medium for many new types of services such as location-based services and streaming content. Subscribers to such services ...
Marina Blanton, Keith B. Frikken
IJNSEC
2008
103views more  IJNSEC 2008»
13 years 7 months ago
General Group Oriented ID-based Cryptosystems with Chosen Plaintext Security
A scheme for general group oriented ID-based cryptosystems is proposed. This scheme allows an authorized subset in the general access structure to cooperatively decrypt the cipher...
Chunxiang Xu, Junhui Zhou, Guozhen Xiao
EUROCRYPT
2006
Springer
13 years 11 months ago
Compact Group Signatures Without Random Oracles
We present the first efficient group signature scheme that is provably secure without random oracles. We achieve this result by combining provably secure hierarchical signatures i...
Xavier Boyen, Brent Waters
CORR
2006
Springer
114views Education» more  CORR 2006»
13 years 7 months ago
A New Cryptosystem Based On Hidden Order Groups
Let G1 be a cyclic multiplicative group of order n. It is known that the Diffie-Hellman problem is random self-reducible in G1 with respect to a fixed generator g if (n) is known....
Amitabh Saxena, Ben Soh