679 search results - page 52 / 136 » Using decision problems in public key cryptography |
PKC
2005
Springer
15 years 6 months ago
2005
Springer
We present an attack on DSA smart-cards which combines physical fault injection and lattice reduction techniques. This seems to be the first (publicly reported) physical experimen...
144
click to vote
ESAS
2004
Springer
15 years 6 months ago
2004
Springer
In this paper we describe the advantages of using iterative Diffie-Hellman (IDH) key trees for mobile ad-hoc group communication. We focus on the Treebased Group Diffie-Hellman (...
141
click to vote
ASIACRYPT
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We describe a public-key encryption scheme based on lattices — specifically, based on the hardness of the learning with error (LWE) problem — that is secure against ...
126
click to vote
CIG
2005
IEEE
15 years 7 months ago
2005
IEEE
Abstract- Recently, P2P (peer-to-peer) online game systems have attracted a great deal of public attention. They work without central servers, thus, the maintenance and organizatio...
116
click to vote
TCC
2009
Springer
16 years 1 months ago
2009
Springer
It is well known that universally composable multiparty computation cannot, in general, be achieved in the standard model without setup assumptions when the adversary can corrupt a...