2967 search results - page 201 / 594 » Cryptology |
178
click to vote
ACNS
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We present an efficient implementation of the Orlandi protocol which is the first implementation of a protocol for multiparty computation on arithmetic circuits, which is...
224
click to vote
EUROCRYPT
2010
Springer
15 years 10 months ago
2010
Springer
We construct an efficient identity based encryption system based on the standard learning with errors (LWE) problem. Our security proof holds in the standard model. The key step in...
181
click to vote
AFRICACRYPT
2008
Springer
15 years 9 months ago
2008
Springer
Proof-of-work schemes are economic measures to deter denial-of-service attacks: service requesters compute moderately hard functions the results of which are easy to check by the ...
204
click to vote
AFRICACRYPT
2008
Springer
15 years 9 months ago
2008
Springer
: In this paper, we have presented flaws in differential cryptanalysis of reduced round variant of PRESENT given by M.Wang in [3] [4] for 80 bits key length and we have shown that ...
184
click to vote
ASIACRYPT
2008
Springer
15 years 9 months ago
2008
Springer
Recently, Desmedt et al. studied the problem of achieving secure n-party computation over non-Abelian groups. They considered the passive adversary model and they assumed that the...