Sciweavers

50 search results - page 10 / 10
» Cryptanalysis of Two Group Signature Schemes
Sort
View
CCS
2008
ACM
13 years 7 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
CSFW
2010
IEEE
13 years 9 months ago
Impossibility Results for Secret Establishment
—Security protocol design is a creative discipline where the solution space depends on the problem to be solved and the cryptographic operators available. In this paper, we exami...
Benedikt Schmidt, Patrick Schaller, David A. Basin
ICPADS
2005
IEEE
13 years 11 months ago
Separable and Anonymous Identity-Based Key Issuing
Abstract. In identity-based (ID-based) cryptosystems, a local registration authority (LRA) is responsible for authentication of users while the key generation center (KGC) is respo...
Ai Fen Sui, Sherman S. M. Chow, Lucas Chi Kwong Hu...
JSAC
2007
116views more  JSAC 2007»
13 years 4 months ago
GroCoca: group-based peer-to-peer cooperative caching in mobile environment
— In a mobile cooperative caching environment, we observe the need for cooperating peers to cache useful data items together, so as to improve cache hit from peers. This could be...
Chi-Yin Chow, Hong Va Leong, Alvin T. S. Chan
KAIS
2006
247views more  KAIS 2006»
13 years 5 months ago
XCQ: A queriable XML compression system
XML has already become the de facto standard for specifying and exchanging data on the Web. However, XML is by nature verbose and thus XML documents are usually large in size, a fa...
Wilfred Ng, Wai Yeung Lam, Peter T. Wood, Mark Lev...