Sciweavers

524 search results - page 35 / 105
» On the Security of the DeKaRT Primitive
Sort
View
EUROCRYPT
2000
Springer
14 years 19 days ago
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
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...
Ronald Cramer, Ivan Damgård, Ueli M. Maurer
ISCA
2011
IEEE
269views Hardware» more  ISCA 2011»
13 years 22 days ago
Crafting a usable microkernel, processor, and I/O system with strict and provable information flow security
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. ...
Mohit Tiwari, Jason Oberg, Xun Li 0001, Jonathan V...
CCS
2001
ACM
14 years 1 months ago
The faithfulness of abstract protocol analysis: message authentication
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...
Joshua D. Guttman, F. Javier Thayer, Lenore D. Zuc...
EUROCRYPT
2008
Springer
13 years 10 months ago
Efficient Two Party and Multi Party Computation Against Covert Adversaries
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...
Vipul Goyal, Payman Mohassel, Adam Smith
OOPSLA
1999
Springer
14 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