679 search results - page 55 / 136 » Using decision problems in public key cryptography |
119
click to vote
ESORICS
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. Many protocols rely on audit trails to allow an impartial judge to verify a posteriori some property of a protocol run. However, in current practice the choice of what da...
114
click to vote
IACR
2011
14 years 1 months ago
2011
The wild McEliece cryptosystem uses wild Goppa codes over finite fields to achieve smaller public key sizes compared to the original McEliece cryptosystem at the same level of se...
116
click to vote
RSCTC
2000
Springer
15 years 5 months ago
2000
Springer
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
102
click to vote
DEDS
2007
15 years 1 months ago
2007
Decentralized diagnosis of discrete event systems has received a lot of attention to deal with distributed systems or with systems that may be too large to be diagnosed by one cen...
114
click to vote
EUROCRYPT
2008
Springer
15 years 3 months ago
2008
Springer
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...