Sciweavers

977 search results - page 29 / 196
» Secure Computation with Fixed-Point Numbers
Sort
View
EUROCRYPT
2000
Springer
13 years 11 months ago
Computing Inverses over a Shared Secret Modulus
We discuss the following problem: Given an integer shared secretly among n players and a prime number e, how can the players efficiently compute a sharing of e-1 mod . The most in...
Dario Catalano, Rosario Gennaro, Shai Halevi
GRID
2005
Springer
14 years 1 months ago
Bridging organizational network boundaries on the grid
— The Grid offers significant opportunities for performing wide area distributed computing, allowing multiple organizations to collaborate and build dynamic and flexible virtual ...
Jefferson Tan, David Abramson, Colin Enticott
HPCA
2011
IEEE
12 years 11 months ago
Architectural framework for supporting operating system survivability
The ever increasing size and complexity of Operating System (OS) kernel code bring an inevitable increase in the number of security vulnerabilities that can be exploited by attack...
Xiaowei Jiang, Yan Solihin
STACS
2007
Springer
14 years 1 months ago
On the Automatic Analysis of Recursive Security Protocols with XOR
Abstract. In many security protocols, such as group protocols, principals have to perform iterative or recursive computations. We call such protocols recursive protocols. Recently,...
Ralf Küsters, Tomasz Truderung
PKC
2004
Springer
160views Cryptology» more  PKC 2004»
14 years 1 months ago
Constant Round Authenticated Group Key Agreement via Distributed Computation
Abstract. A group key agreement protocol allows a set of users, communicating over a public network, to agree on a private session key. Most of the schemes proposed so far require ...
Emmanuel Bresson, Dario Catalano