Sciweavers

243 search results - page 2 / 49
» Safe Areas of Computation for Secure Computing with Insecure...
Sort
View
TCC
2009
Springer
131views Cryptology» more  TCC 2009»
14 years 9 months ago
Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
It is well known that general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model. ...
Robin Künzler, Jörn Müller-Quade, D...
CCS
2004
ACM
14 years 1 months ago
Cryptanalysis of a provably secure CRT-RSA algorithm
We study a countermeasure proposed to protect Chinese remainder theorem (CRT) computations for RSA against fault attacks. The scheme was claimed to be provably secure. However, we...
David Wagner
SP
2009
IEEE
155views Security Privacy» more  SP 2009»
14 years 3 months ago
A Logic of Secure Systems and its Application to Trusted Computing
We present a logic for reasoning about properties of secure systems. The logic is built around a concurrent programming language with constructs for modeling machines with shared ...
Anupam Datta, Jason Franklin, Deepak Garg, Dilsun ...
IJNSEC
2010
143views more  IJNSEC 2010»
13 years 3 months ago
A New Secure Remote User Authentication Scheme with Smart Cards
Remote user authentication scheme is one of the simplest and the most convenient authentication mechanisms to deal with secret data over insecure networks. These types of schemes ...
Manoj Kumar
IACR
2011
94views more  IACR 2011»
12 years 8 months ago
Secure Computation with Sublinear Amortized Work
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov,...