729 search results - page 57 / 146 » And Or Hierarchies and Round Abstraction |
ICCSA
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Many problems in computer science are related to scheduling problems or embedding problems. Therefore it is an interesting topic to find efficient (approximation) algori...
CRYPTO
2001
Springer
14 years 2 months ago
2001
Springer
d Abstract) Philip MacKenzie and Michael K. Reiter Bell Labs, Lucent Technologies, Murray Hill, NJ, USA We describe a means of sharing the DSA signature function, so that two parti...
ICCCN
1998
IEEE
14 years 2 months ago
1998
IEEE
This paper analyzes both the strong points and weak points of OSPF routing protocol from security perspective. On its strong points, we abstract its features of information least ...
FC
2010
Springer
14 years 2 months ago
2010
Springer
Abstract We propose several variants of a secure multiparty computation protocol for AES encryption. The best variant requires 2200 + 400 255 expected elementary operations in expe...
CRYPTO
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. We consider the problem of random selection, where p players follow a protocol to jointly select a random element of a universe of size n. However, some of the players ma...