524 search results - page 35 / 105 » On the Security of the DeKaRT Primitive |
143
click to vote
EUROCRYPT
2000
Springer
15 years 5 months ago
2000
Springer
We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) f...
160
click to vote
ISCA
2011
IEEE
14 years 5 months ago
2011
IEEE
High assurance systems used in avionics, medical implants, and cryptographic devices often rely on a small trusted base of hardware and software to manage the rest of the system. ...
116
click to vote
CCS
2001
ACM
15 years 6 months ago
2001
ACM
hfulness of Abstract Protocol Analysis: Message Authentication∗ Joshua D. Guttman F. Javier Thayer Lenore D. Zuck December 18, 2002 Dolev and Yao initiated an approach to studyi...
158
Voted
EUROCRYPT
2008
Springer
15 years 3 months ago
2008
Springer
Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure...
133
Voted
OOPSLA
1999
Springer
15 years 6 months ago
1999
Springer
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...