29 search results - page 4 / 6 » Notions and relations for RKA-secure permutation and functio... |
STACS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We consider the problem of scheduling jobs on related machines owned by selfish agents and provide the first deterministic mechanisms with constant approximation that a...
IACR
2011
12 years 4 months ago
2011
Abstract. We show that the Winternitz one-time signature scheme is existentially unforgeable under adaptive chosen message attacks when instantiated with a family of pseudo random ...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
d abstract) Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank It is well known that the secure computation of non-trivial functionalities in the setting of no honest majori...
ASIACRYPT
2009
Springer
13 years 12 months ago
2009
Springer
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
ITP
2010
13 years 9 months ago
2010
CertiCrypt is a general framework to certify the security of cryptographic primitives in the Coq proof assistant. CertiCrypt adopts the code-based paradigm, in which the statement ...