143 search results - page 14 / 29 » A Range Test Secure in the Active Adversary Model |
STOC
2000
ACM
14 years 5 days ago
2000
ACM
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...
CCS
2009
ACM
14 years 3 months ago
2009
ACM
Formal analysis of security protocols based on symbolic models has been very successful in finding flaws in published protocols and proving protocols secure, using automated too...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a truste...
ICANN
2003
Springer
14 years 1 months ago
2003
Springer
We propose a simple method to map a generic threshold model, namely the Spike Response Model, to artificial data of neuronal activity using a minimal amount of a priori informatio...
PODC
2009
ACM
14 years 9 months ago
2009
ACM
Global consistency or Byzantine Agreement (BA) and reliable point-to-point communication are two of the most important and well-studied problems in distributed computing. Informal...