Sciweavers

111 search results - page 19 / 23
» Characterization of Secure Multiparty Computation Without Br...
Sort
View
73
Voted
CHI
2004
ACM
15 years 10 months ago
Passwords you'll never forget, but can't recall
We identify a wide range of human memory phenomena as potential certificates of identity. These "imprinting" behaviors are characterized by vast capacity for complex exp...
Daphna Weinshall, Scott Kirkpatrick
OOPSLA
1999
Springer
15 years 1 months ago
Mostly-copying Reachability-based Orthogonal Persistence
We describe how reachability-based orthogonal persistence can be supported even in uncooperative implementations of languages such as C++ and Modula-3, and without modification t...
Antony L. Hosking, Jiawan Chen
SOSP
2007
ACM
15 years 6 months ago
Bouncer: securing software by blocking bad input
Attackers exploit software vulnerabilities to control or crash programs. Bouncer uses existing software instrumentation techniques to detect attacks and it generates filters auto...
Manuel Costa, Miguel Castro, Lidong Zhou, Lintao Z...
ASIACRYPT
2011
Springer
13 years 9 months ago
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
Divesh Aggarwal, Ueli Maurer
WPES
2003
ACM
15 years 2 months ago
Anonymous credentials with biometrically-enforced non-transferability
We present a model and protocol for anonymous credentials. Rather than using deterrents to ensure non-transferability, our model uses secure hardware with biometric authentication...
Russell Impagliazzo, Sara Miner More