Sciweavers

2237 search results - page 140 / 448
» On the Security of Random Sources
Sort
View
CRYPTO
2001
Springer
106views Cryptology» more  CRYPTO 2001»
15 years 10 months ago
Forward-Secure Signatures with Optimal Signing and Verifying
We propose the first forward-secure signature scheme for which both signing and verifying are as efficient as for one of the most efficient ordinary signature schemes (Guillou-Qui...
Gene Itkis, Leonid Reyzin
IAT
2009
IEEE
15 years 9 months ago
Developing a Deterministic Patrolling Strategy for Security Agents
Abstract—Developing autonomous systems that patrol environments for detecting intruders is a topic of increasing relevance in security applications. An important aspect of these ...
Nicola Basilico, Nicola Gatti, Francesco Amigoni
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
164
Voted
ECCC
2000
93views more  ECCC 2000»
15 years 6 months ago
Security of the Most Significant Bits of the Shamir Message Passing Scheme
Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element of a finite field Fp of p elements from rather short strings of...
Maria Isabel Gonzalez Vasco, Igor Shparlinski
INFORMATICALT
2010
132views more  INFORMATICALT 2010»
15 years 3 months ago
An Improved Securer and Efficient Nonce-Based Authentication Scheme with Token-Update
In this paper, we propose a mutual authentication scheme using nonce variable instead of Mac address and accompanying with token updates to improve the functionality. Lee et al. (2...
Chiu-Hsiung Liao, Ching-Te Wang, Hon-Chan Chen