Sciweavers

5484 search results - page 296 / 1097
» Almost-Everywhere Secure Computation
Sort
View
FC
2001
Springer
123views Cryptology» more  FC 2001»
15 years 11 months ago
Trust: A Collision of Paradigms
The technological challenges of securing networks are great, as recently witnessed in widespread denial of service and virus attacks. The human reaction to these attacks may be ei...
L. Jean Camp, Helen Nissenbaum, Cathleen McGrath
FPLAY
2008
15 years 8 months ago
Lessons from Brain Age on password memorability
User authentication involves establishing a user's right to access a system. Most user authentication is done with text passwords, which have advantages over other approaches...
Alain Forget, Sonia Chiasson, Robert Biddle
LICS
2006
IEEE
16 years 22 days ago
Provable Implementations of Security Protocols
for reasoning about abstract models of protocols. The work on informal methods attempts to discern common patterns in the extensive record of flawed protocols, and to formulate po...
Andrew D. Gordon
SIGITE
2005
ACM
16 years 8 days ago
Integration of information assurance and security into the IT2005 model curriculum
In this paper we present the context of the work of the Curriculum Committee on IT2005, the IT curriculum volume described in the Overview Draft document of the Joint Task Force f...
Melissa Jane Dark, Joseph J. Ekstrom, Barry M. Lun...
EUROCRYPT
2006
Springer
15 years 10 months ago
Security Analysis of the Strong Diffie-Hellman Problem
Let g be an element of prime order p in an abelian group and Zp. We show that if g, g , and gd are given for a positive divisor d of p - 1, we can compute the secret in O(log p
Jung Hee Cheon