Sciweavers

5665 search results - page 91 / 1133
» Introduction to Computer Security
Sort
View
CRYPTO
2000
Springer
110views Cryptology» more  CRYPTO 2000»
14 years 1 months ago
Parallel Reducibility for Information-Theoretically Secure Computation
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
Yevgeniy Dodis, Silvio Micali
CRYPTO
2005
Springer
171views Cryptology» more  CRYPTO 2005»
14 years 2 months ago
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...
ICIP
2009
IEEE
14 years 10 months ago
Secure Distortion Computation Among Untrusting Parties Using Homomorphic Encryption
Alice and Bob possess sequences xn and yn respectively and would like to compute d(xn , yn ) where d(., .) is a distortion measure. However, Alice and Bob do not trust each other ...
VLSID
2009
IEEE
110views VLSI» more  VLSID 2009»
14 years 9 months ago
Security and Dependability of Embedded Systems: A Computer Architects' Perspective
Jörg Henkel, Roshan G. Ragel, Sri Parameswara...