Sciweavers

5665 search results - page 74 / 1133
» Introduction to Computer Security
Sort
View
STOC
2007
ACM
102views Algorithms» more  STOC 2007»
14 years 9 months ago
Zero-knowledge from secure multiparty computation
A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multipar...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, A...
EUROCRYPT
2007
Springer
14 years 23 days ago
Round-Efficient Secure Computation in Point-to-Point Networks
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
Jonathan Katz, Chiu-Yuen Koo
AAAI
2010
13 years 10 months ago
Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games
Recently, algorithms for computing game-theoretic solutions have been deployed in real-world security applications, such as the placement of checkpoints and canine units at Los An...
Dmytro Korzhyk, Vincent Conitzer, Ronald Parr
JSW
2008
89views more  JSW 2008»
13 years 8 months ago
Secure Set Union and Bag Union Computation for Guaranteeing Anonymity of Distrustful Participants
Abstract-- The computation of the union operator for different distributed datasets involves two challenges when participants are curious and can even act malicious: guaranteeing a...
Stefan Böttcher, Sebastian Obermeier
FC
2009
Springer
95views Cryptology» more  FC 2009»
14 years 3 months ago
Secure Multiparty Computation Goes Live
In this note, we report on the first large-scale and practical application of secure multiparty computation, which took place in January 2008. We also report on the novel cryptogr...
Peter Bogetoft, Dan Lund Christensen, Ivan Damg&ar...