2601 search results - page 205 / 521 » Secure Rewarding Schemes |
128
Voted
IACR
2011
14 years 3 months ago
2011
We study the problem of authentication based on a weak key in the information-theoretic setting. A key is weak if its min-entropy is an arbitrary small fraction of its bit length. ...
119
Voted
ASIACRYPT
2009
Springer
15 years 10 months ago
2009
Springer
Group encryption (GE) schemes, introduced at Asiacrypt’07, are an encryption analogue of group signatures with a number of interesting applications. They allow a sender to encryp...
115
click to vote
IEEEARES
2007
IEEE
15 years 9 months ago
2007
IEEE
Remote electronic voting over the Internet is a promising concept to afford convenience to voters and to increase election turnouts. However, before employing electronic voting sy...
111
click to vote
CHES
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. It has recently been shown that logic circuits in the implementation of cryptographic algorithms, although protected by “secure” random masking schemes, leak side-cha...
152
Voted
PQCRYPTO
2010
15 years 7 months ago
2010
Abstract. We propose a variant of the “bonsai tree” signature scheme, a latticebased existentially unforgeable signature scheme in the standard model. Our construction offers ...