6164 search results - page 397 / 1233 » Teaching Computer Security |
174
click to vote
EUROCRYPT
2006
Springer
15 years 10 months ago
2006
Springer
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
224
click to vote
SASN
2003
ACM
16 years 3 days ago
2003
ACM
Peer-to-Peer (P2P) applications and services are very common in today’s computing. The popularity of the P2P paradigm prompts the need for specialized security services which ma...
163
click to vote
WMCSA
2008
IEEE
16 years 1 months ago
2008
IEEE
We show how to convert regular keyboard-entry CAPTCHAs into clickable CAPTCHAs. The goal of this conversion is to simplify and speed-up the entry of the CAPTCHA solution, to minim...
141
Voted
ACMSE
2007
ACM
15 years 11 months ago
2007
ACM
Information security is a growing concern today for organizations and individuals alike. This has led to growing interest in more aggressive forms of defense to supplement the exi...
204
click to vote
PODC
2010
ACM
15 years 7 months ago
2010
ACM
We present information-theoretically secure schemes for sharing and modifying secrets among a dynamic swarm of computing devices. The schemes support an unlimited number of change...