1612 search results - page 134 / 323 » About models of security protocols |
131
click to vote
CRYPTO
2006
Springer
15 years 7 months ago
2006
Springer
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...
139
click to vote
SIAMCOMP
2008
15 years 2 months ago
2008
We initiate the study of two-party cryptographic primitives with unconditional security, assuming that the adversary's quantum memory is of bounded size. We show that oblivio...
116
click to vote
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
We initiate the study of two-party cryptographic primitives with unconditional security, assuming that the adversary’s quantum memory is of bounded size. We show that oblivious ...
144
Voted
SOUPS
2010
ACM
15 years 8 months ago
2010
ACM
Home computer systems are frequently insecure because they are administered by untrained, unskilled users. The rise of botnets has amplified this problem; attackers can compromis...
139
click to vote
EUROCRYPT
2004
Springer
15 years 8 months ago
2004
Springer
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...