154 search results - page 23 / 31 » Proving Group Protocols Secure Against Eavesdroppers |
ASIACRYPT
2009
Springer
15 years 4 months ago
2009
Springer
Computational puzzles are mildly difficult computational problems that require resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in secu...
103
click to vote
ACNS
2007
Springer
15 years 4 months ago
2007
Springer
In 1990, Boyar, Chaum, Damg˚ard and Pedersen introduced convertible undeniable signatures which limit the self-authenticating property of digital signatures but can be converted b...
TCC
2010
Springer
15 years 6 months ago
2010
Springer
We present a variant of Regev’s cryptosystem first presented in [Reg05], but with a new choice of parameters. By a recent classical reduction by Peikert we prove the scheme sema...
EJWCN
2010
14 years 4 months ago
2010
To achieve off-line delegation for mobile readers, we propose a delegation protocol for mobile RFID allowing its readers access to specific tags through back-end server. That is t...
IJNSEC
2011
14 years 4 months ago
2011
The popularization and conveniences of Internet have changed traditional auction transactions into electronic auction via Internet. In 2006, Chang and Chang proposed an anonymous ...