Sciweavers

686 search results - page 43 / 138
» Secure Two-Party Computation Is Practical
Sort
View
ASIACRYPT
2009
Springer
16 years 17 days ago
A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical
The design of cryptographic hash functions is a very complex and failure-prone process. For this reason, this paper puts forward a completely modular and fault-tolerant approach to...
Anja Lehmann, Stefano Tessaro
ARITH
1999
IEEE
15 years 10 months ago
Montgomery Modular Exponentiation on Reconfigurable Hardware
It is widely recognized that security issues will play a crucial role in the majority of future computer and communication systems. Central tools for achieving system security are...
Thomas Blum
WECWIS
2005
IEEE
116views ECommerce» more  WECWIS 2005»
15 years 11 months ago
Security and Privacy Using One-Round Zero-Knowledge Proofs
A zero-knowledge proof (ZKP) is an interactive proof that allows a prover to prove the knowledge of a secret to a verifier without revealing it. ZKPs are powerful tools to deal wi...
Sultan Almuhammadi, Clifford Neuman
USENIX
2007
15 years 8 months ago
Passwords for Everyone: Secure Mnemonic-based Accessible Authentication
In many environments, a computer system is severely constrained to the extent that the practical input mechanisms are merely binary switches. Requiring the user to remember a long...
Umut Topkara, Mercan Topkara, Mikhail J. Atallah
ACSAC
1998
IEEE
15 years 10 months ago
Protecting Web Servers from Security Holes in Server-Side Includes
This paper first investigates and analyzes security holes concerning the use of Server-Side Includes (SSI) in some of the most used Web server software packages. We show that, by ...
Jared Karro, Jie Wang