Sciweavers

2601 search results - page 72 / 521
» Secure Rewarding Schemes
Sort
View
SCN
2010
Springer
176views Communications» more  SCN 2010»
14 years 10 months ago
The Fiat-Shamir Transform for Group and Ring Signature Schemes
The Fiat-Shamir (FS) transform is a popular tool to produce particularly efficient digital signature schemes out of identification protocols. It is known that the resulting signat...
Ming-Feng Lee, Nigel P. Smart, Bogdan Warinschi
VOTEID
2007
Springer
15 years 6 months ago
Bingo Voting: Secure and Coercion-Free Voting Using a Trusted Random Number Generator
It is debatable if current direct-recording electronic voting machines can sufficiently be trusted for a use in elections. Reports about malfunctions and possible ways of manipulat...
Jens-Matthias Bohli, Jörn Müller-Quade, ...
ISPEC
2009
Springer
15 years 6 months ago
Strongly Unforgeable ID-Based Signatures without Random Oracles
In this paper, we construct a strongly unforgeable ID-based signature scheme without random oracles.4 The signature size of our scheme is smaller than that of other schemes based o...
Chifumi Sato, Takeshi Okamoto, Eiji Okamoto
CCS
2007
ACM
15 years 6 months ago
Attribute-based encryption with non-monotonic access structures
We construct an Attribute-Based Encryption (ABE) scheme that allows a user’s private key to be expressed in terms of any access formula over attributes. Previous ABE schemes wer...
Rafail Ostrovsky, Amit Sahai, Brent Waters
PROVSEC
2010
Springer
14 years 9 months ago
Improved Zero-Knowledge Identification with Lattices
Zero-knowledge identification schemes solve the problem of authenticating one party to another via an insecure channel without disclosing any additional information that might be u...
Pierre-Louis Cayrel, Richard Lindner, Markus R&uum...