5476 search results - page 988 / 1096 » Resettably Secure Computation |
116
click to vote
WWW
2005
ACM
16 years 4 months ago
2005
ACM
We consider the problem of finding duplicates in data streams. Duplicate detection in data streams is utilized in various applications including fraud detection. We develop a solu...
146
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
146
click to vote
EUROCRYPT
2009
Springer
16 years 4 months ago
2009
Springer
We consider information-theoretic key agreement between two parties sharing somewhat different versions of a secret w that has relatively little entropy. Such key agreement, also ...
148
click to vote
EUROCRYPT
2009
Springer
16 years 4 months ago
2009
Springer
The fair evaluation and comparison of side-channel attacks and countermeasures has been a long standing open question, limiting further developments in the field. Motivated by this...
152
click to vote
PKC
2009
Springer
16 years 4 months ago
2009
Springer
Abstract.We introduce the notion of distributed password-based publickey cryptography, where a virtual high-entropy private key is implicitly dened as a concatenation of low-entrop...