Sciweavers

977 search results - page 41 / 196
» Secure Computation with Fixed-Point Numbers
Sort
View
AFRICACRYPT
2010
Springer
14 years 2 months ago
Avoiding Full Extension Field Arithmetic in Pairing Computations
Abstract. The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of ...
Craig Costello, Colin Boyd, Juan Manuel Gonz&aacut...
ICDCS
2002
IEEE
14 years 22 days ago
Key Trees and the Security of Interval Multicast
A key tree is a distributed data structure of security keys that can be used by a group of users. In this paper, we describe how any user in the group can use the different keys i...
Mohamed G. Gouda, Chin-Tser Huang, E. N. Elnozahy
NDSS
1999
IEEE
14 years 1 days ago
A Real-World Analysis of Kerberos Password Security
Kerberos is a distributed authentication system that many organizations use to handle domain-wide password security. Although it has been known for quite some time that Kerberos i...
Thomas D. Wu
SAC
2002
ACM
13 years 7 months ago
Secure mobile agent systems using Java: where are we heading?
Java is the predominant language for mobile agent systems, both for implementing mobile agent execution environments and for writing mobile agent applications. This is due to inhe...
Walter Binder, Volker Roth
FOSSACS
2010
Springer
14 years 2 months ago
The Complexity of Synchronous Notions of Information Flow Security
The paper considers the complexity of verifying that a finite state system satisfies a number of definitions of information flow security. The systems model considered is one i...
Franck Cassez, Ron van der Meyden, Chenyi Zhang