5484 search results - page 1009 / 1097 » Almost-Everywhere Secure Computation |
100
click to vote
EUROCRYPT
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. We present a new algorithm for upper bounding the maximum average linear hull probability for SPNs, a value required to determine provable security against linear cryptan...
111
click to vote
PKC
2001
Springer
15 years 4 months ago
2001
Springer
At ISW’99, Nishioka, Hanaoka and Imai proposed a digital signature scheme on ID-based key-sharing infrastructures. That signature scheme is claimed to be secure if the discrete l...
104
click to vote
EUROCRYPT
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. We consider the problem of sending messages into the future." Previous constructions for this task were either based on heuristic assumptions or did not provide anon...
CRYPTO
1998
Springer
15 years 4 months ago
1998
Springer
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for ...
117
click to vote
MA
1997
Springer
15 years 4 months ago
1997
Springer
This paper presents a mobile agent approach that aims at satisfying the following requirements of open Internet-based electronic service markets: the mobile agent system should be...