Sciweavers

5476 search results - page 208 / 1096
» Resettably Secure Computation
Sort
View
ENTCS
2007
104views more  ENTCS 2007»
15 years 6 months ago
Exogenous Probabilistic Computation Tree Logic
We define a logic EpCTL for reasoning about the evolution of probabilistic systems. System states correspond to probability distributions over classical states and the system evo...
Pedro Baltazar, Paulo Mateus, Rajagopal Nagarajan,...
ISORC
2007
IEEE
16 years 27 days ago
Security Analysis of the Utilization of Corba Object References as Authorization Tokens
In object-oriented real-time computing scenarios, particularly where Corba is used in embedded systems with resource constraints, developers and system architects often utilize Co...
Christoph Becker, Sebastian Staamann, Ralf Salomon
AINA
2005
IEEE
16 years 7 days ago
An Improved Low Computation Cost User Authentication Scheme for Mobile Communication
Most of existing user authentication schemes require high computation cost of exponentiation operations for the purpose of security. However, it is not suitable for mobile devices...
Chia-Yin Lee, Chu-Hsing Lin, Chin-Chen Chang
CRYPTO
1990
Springer
79views Cryptology» more  CRYPTO 1990»
15 years 10 months ago
Fair Computation of General Functions in Presence of Immoral Majority
This paper describes a method for n players, a majority of which may be faulty, to compute correctly, privately, and fairly any computable function f(Xl, ...,x,) where xi is the i...
Shafi Goldwasser, Leonid A. Levin
CRYPTO
1992
Springer
154views Cryptology» more  CRYPTO 1992»
15 years 10 months ago
Massively Parallel Computation of Discrete Logarithms
Numerous cryptosystems have been designed to be secure under the assumption that the computation of discrete logarithms is infeasible. This paper reports on an aggressive attempt ...
Daniel M. Gordon, Kevin S. McCurley