Sciweavers

2601 search results - page 332 / 521
» Secure Rewarding Schemes
Sort
View
PKC
2007
Springer
99views Cryptology» more  PKC 2007»
15 years 10 months ago
Full-Domain Subgroup Hiding and Constant-Size Group Signatures
We give a short constant-size group signature scheme, which we prove fully secure under reasonable assumptions in bilinear groups, in the standard model. We achieve this result by ...
Xavier Boyen, Brent Waters
CRYPTO
2010
Springer
157views Cryptology» more  CRYPTO 2010»
15 years 5 months ago
Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability - (or: Quadratic Residuosity Strikes Ba
The main results of this work are new public-key encryption schemes that, under the quadratic residuosity (QR) assumption (or Paillier's decisional composite residuosity (DCR...
Zvika Brakerski, Shafi Goldwasser
JCP
2006
94views more  JCP 2006»
15 years 4 months ago
Broadcast Encryption Using Probabilistic Key Distribution and Applications
A family of novel broadcast encryption schemes based on probabilistic key pre-distribution are proposed, that enable multiple sources to broadcast secrets, without the use of asymm...
Mahalingam Ramkumar
CORR
2011
Springer
187views Education» more  CORR 2011»
14 years 11 months ago
Failure of A Mix Network
A mix network by Wikstrom fails in correctness, provable privacy and soundness. Its claimed advantages in security and efficiency are compromised. The analysis in this paper illus...
Kun Peng
CHI
2008
ACM
16 years 4 months ago
Undercover: authentication usable in front of prying eyes
A number of recent scams and security attacks (phishing, spyware, fake terminals, ...) hinge on a crook's ability to observe user behavior. In this paper, we describe the des...
Hirokazu Sasamoto, Nicolas Christin, Eiji Hayashi