Sciweavers

30 search results - page 4 / 6
» On Partial Anonymity in Secret Sharing
Sort
View
MINENET
2006
ACM
14 years 1 months ago
SC2D: an alternative to trace anonymization
Progress in networking research depends crucially on applying novel analysis tools to real-world traces of network activity. This often conflicts with privacy and security requir...
Jeffrey C. Mogul, Martin F. Arlitt
ASIACRYPT
2003
Springer
13 years 11 months ago
Efficient Group Signatures without Trapdoors
Abstract. Group signature schemes are fundamental cryptographic tools that enable unlinkably anonymous authentication, in the same fashion that digital signatures provide the basis...
Giuseppe Ateniese, Breno de Medeiros
STOC
2005
ACM
150views Algorithms» more  STOC 2005»
14 years 7 months ago
Correcting errors without leaking partial information
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
Yevgeniy Dodis, Adam Smith
CRYPTO
1994
Springer
98views Cryptology» more  CRYPTO 1994»
13 years 11 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...
CCS
2009
ACM
14 years 8 months ago
The union-split algorithm and cluster-based anonymization of social networks
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
Brian Thompson, Danfeng Yao