Sciweavers

1064 search results - page 147 / 213
» Cryptography from Anonymity
Sort
View
PKC
2000
Springer
132views Cryptology» more  PKC 2000»
14 years 27 days ago
The Composite Discrete Logarithm and Secure Authentication
For the two last decades, electronic authentication has been an important topic. The first applications were digital signatures to mimic handwritten signatures for digital document...
David Pointcheval
EUROCRYPT
1995
Springer
14 years 26 days ago
Fair Blind Signatures
Abstract. A blind signature scheme is a protocol for obtaining a signature from a signer such that the signer's view of the protocol cannot be linked to the resulting message-...
Markus Stadler, Jean-Marc Piveteau, Jan Camenisch
USS
2008
13 years 11 months ago
Multi-flow Attacks Against Network Flow Watermarking Schemes
We analyze several recent schemes for watermarking network flows based on splitting the flow into intervals. We show that this approach creates time dependent correlations that en...
Negar Kiyavash, Amir Houmansadr, Nikita Borisov
ACSC
2008
IEEE
13 years 11 months ago
An efficient hash-based algorithm for minimal k-anonymity
A number of organizations publish microdata for purposes such as public health and demographic research. Although attributes of microdata that clearly identify individuals, such a...
Xiaoxun Sun, Min Li, Hua Wang, Ashley W. Plank
AAAI
2006
13 years 10 months ago
Handling Self-Interest in Groups, with Minimal Cost
In group decision-making problems that involve selfinterested agents with private information, reaching socially optimal outcomes requires aligning the goals of individuals with t...
Ruggiero Cavallo