135 search results - page 26 / 27 » Formal Indistinguishability Extended to the Random Oracle Mo... |
CCS
2001
ACM
15 years 4 months ago
2001
ACM
A group signature scheme allows a group member to sign messages anonymously on behalf of the group, while in case of a dispute, a designated entity can reveal the identity of a si...
78
Voted
EUROCRYPT
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. We consider the question of protecting the privacy of customers buying digital goods. More specifically, our goal is to allow a buyer to purchase digital goods from a ve...
116
click to vote
STOC
2009
ACM
16 years 7 days ago
2009
ACM
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
119
click to vote
JACM
2000
14 years 11 months ago
2000
We identify and study a natural and frequently occurring subclass of Concurrent Read, Exclusive Write Parallel Random Access Machines (CREW-PRAMs). Called Concurrent Read, Owner Wr...
89
Voted
ICCV
1999
IEEE
16 years 1 months ago
1999
IEEE
Existing sequential feature-based registration algorithms involving search typically either select features randomly (eg. the RANSAC[8] approach) or assume a predefined, intuitive...