Sciweavers

36 search results - page 7 / 8
» Security Against Covert Adversaries: Efficient Protocols for...
Sort
View
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
13 years 9 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...
TWC
2008
156views more  TWC 2008»
13 years 5 months ago
Secure and Fault-Tolerant Event Boundary Detection in Wireless Sensor Networks
Event boundary detection is in and of itself a useful application in wireless sensor networks (WSNs). Typically, it includes the detection of a large-scale spatial phenomenon such ...
Kui Ren, Kai Zeng, Wenjing Lou
CRYPTO
2006
Springer
159views Cryptology» more  CRYPTO 2006»
13 years 9 months ago
Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
Abstract. The problem of perfectly secure message transmission concerns two synchronized non-faulty processors sender (S) and receiver (R) that are connected by a synchronous netwo...
Saurabh Agarwal, Ronald Cramer, Robbert de Haan
TIT
2008
147views more  TIT 2008»
13 years 5 months ago
On Codes, Matroids, and Secure Multiparty 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, the connections between codes, matroids, and a special cla...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...
IWCMC
2006
ACM
13 years 12 months ago
Modeling key agreement in multi-hop ad hoc networks
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...
Giovanni Di Crescenzo, Maria Striki, John S. Baras