Sciweavers

6164 search results - page 76 / 1233
» Teaching Computer Security
Sort
View
133
Voted
SCN
2008
Springer
142views Communications» more  SCN 2008»
15 years 2 months ago
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [13]. This is the first running sy...
Yehuda Lindell, Benny Pinkas, Nigel P. Smart
ISI
2006
Springer
15 years 2 months ago
A Trust-Based Security Architecture for Ubiquitous Computing Systems
Hung Le Xuan, Pho Duc Giang, Yonil Zhung, Tran Van...
PROVSEC
2009
Springer
15 years 9 months ago
GUC-Secure Set-Intersection Computation
Secure set-intersection computation is one of important problems in secure multiparty computation with various applications. We propose a general construction for secure 2-party se...
Yuan Tian, Hao Zhang
118
Voted
MOC
2010
14 years 9 months ago
Computing a lower bound for the canonical height on elliptic curves over number fields
Computing a lower bound for the canonical height is a crucial step in determining a Mordell
Thotsaphon Thongjunthug
CCS
2008
ACM
15 years 4 months ago
Computationally sound mechanized proofs for basic and public-key Kerberos
Bruno Blanchet, Aaron D. Jaggard, Andre Scedrov, J...