Sciweavers

686 search results - page 34 / 138
» Secure Two-Party Computation Is Practical
Sort
View
GAMESEC
2010
244views Game Theory» more  GAMESEC 2010»
13 years 7 months ago
The Password Game: Negative Externalities from Weak Password Practices
The combination of username and password is widely used as a human authentication mechanism on the Web. Despite this universal adoption and despite their long tradition, password s...
Sören Preibusch, Joseph Bonneau
COMPSAC
2000
IEEE
14 years 2 months ago
Chinese Wall Security Model and Conflict Analysis
Brewer and Nash, and immediately updated by this author, introduced Chinese Wall security policy models for commercial security. Applying Pawlak's idea of conflict analysis, ...
Tsau Young Lin
CSE
2009
IEEE
14 years 1 months ago
Adapting Privacy-Preserving Computation to the Service Provider Model
There are many applications for Secure Multi-Party Computation (SMC), but practical adoption is still an issue. One reason is that the business model of the application does not m...
Florian Kerschbaum
CRYPTO
2001
Springer
95views Cryptology» more  CRYPTO 2001»
14 years 2 months ago
Robustness for Free in Unconditional Multi-party Computation
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...
Martin Hirt, Ueli M. Maurer
CSI
2007
54views more  CSI 2007»
13 years 9 months ago
A practical verifiable multi-secret sharing scheme
C.-C. Yang, T.-Y. Chang, M.-S. Hwang [C.-C. Yang, T.-Y. Chang, M.-S. Hwang, A (t,n) multi-secret sharing scheme, Applied Mathematics and Computation 151 (2004) 483–490] proposed...
Jian-jie Zhao, Jianzhong Zhang 0005, Rong Zhao