1564 search results - page 231 / 313 » Security in Practice - Security-Usability Chasm |
EUROCRYPT
2000
Springer
15 years 1 months ago
2000
Springer
Voting schemes that provide receipt-freeness prevent voters from proving their cast vote, and hence thwart vote-buying and coercion. We analyze the security of the multi-authority ...
FC
2000
Springer
15 years 1 months ago
2000
Springer
For the two last decades, people have tried to provide practical electronic cash schemes, with more or less success. Indeed, the most secure ones generally suffer from inefficiency...
132
click to vote
OOPSLA
2000
Springer
15 years 1 months ago
2000
Springer
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
EUROCRYPT
2010
Springer
15 years 1 months ago
2010
Springer
We present a family of verifiable random functions which are provably secure for exponentially-large input spaces under a non-interactive complexity assumption. Prior construction...
USS
2008
15 years 6 days ago
2008
In light of the systemic vulnerabilities uncovered by recent reviews of deployed e-voting systems, the surest way to secure the voting process would be to scrap the existing syste...