Sciweavers

87 search results - page 13 / 18
» Random Selection with an Adversarial Majority
Sort
View
CORR
2010
Springer
86views Education» more  CORR 2010»
13 years 5 months ago
Secure Multiparty Computation with Partial Fairness
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...
Amos Beimel, Eran Omri, Ilan Orlov
DSN
2003
IEEE
14 years 11 days ago
Characterization of Linux Kernel Behavior under Errors
This paper describes an experimental study of Linux kernel behavior in the presence of errors that impact the instruction stream of the kernel code. Extensive error injection exper...
Weining Gu, Zbigniew Kalbarczyk, Ravishankar K. Iy...
NAR
2006
68views more  NAR 2006»
13 years 7 months ago
Panzea: a database and resource for molecular and functional diversity in the maize genome
Serving as a community resource, Panzea (http:// www.panzea.org) is the bioinformatics arm of the Molecular and Functional Diversity in the Maize Genome project. Maize, a classica...
Wei Zhao, Payan Canaran, Rebecca Jurkuta, Theresa ...
SP
2010
IEEE
217views Security Privacy» more  SP 2010»
13 years 11 months ago
Experimental Security Analysis of a Modern Automobile
Abstract—Modern automobiles are no longer mere mechanical devices; they are pervasively monitored and controlled by dozens of digital computers coordinated via internal vehicular...
Karl Koscher, Alexei Czeskis, Franziska Roesner, S...
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
14 years 4 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...