Sciweavers

55 search results - page 10 / 11
» On the Minimal Assumptions of Group Signature Schemes
Sort
View
INFOCOM
2002
IEEE
13 years 10 months ago
Optimal on-line estimation of the size of a dynamic multicast group
Abstract—In this paper we propose an efficient on-line estimation algorithm for determining the size of a dynamic multicast group. By using diffusion approximation and Kalman ...
Sara Alouf, Eitan Altman, Philippe Nain
CCS
2010
ACM
14 years 19 days ago
Attribute-based signature and its applications
In an attribute-based signature (ABS), users sign messages with any predicate of their attributes issued from an attribute authority. Under this notion, a signature attests not to...
Jin Li, Man Ho Au, Willy Susilo, Dongqing Xie, Kui...
CCS
2008
ACM
13 years 7 months ago
Multi-use unidirectional proxy re-signatures
In 1998, Blaze, Bleumer, and Strauss suggested a cryptographic primitive termed proxy re-signature in which a proxy transforms a signature computed under Alice's secret key in...
Benoît Libert, Damien Vergnaud
WWW
2008
ACM
13 years 5 months ago
Divide, Compress and Conquer: Querying XML via Partitioned Path-Based Compressed Data Blocks
We propose a novel Partition Path-Based (PPB) grouping strategy to store compressed XML data in a stream of blocks. In addition, we employ a minimal indexing scheme called Block S...
Wilfred Ng, Ho Lam Lau, Aoying Zhou
CRYPTO
1994
Springer
98views Cryptology» more  CRYPTO 1994»
13 years 10 months ago
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S...
Ronald Cramer, Ivan Damgård, Berry Schoenmak...