Sciweavers

6568 search results - page 58 / 1314
» Reducing the Complexity of Reductions
Sort
View
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
15 years 8 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...
139
Voted
ICPR
2008
IEEE
15 years 11 months ago
A network intrusion detection method using independent component analysis
An intrusion detection system (IDS) detects illegal manipulations of computer systems. In intrusion detection systems, feature reduction, including feature extraction and feature ...
Dayu Yang, Hairong Qi
COCO
2009
Springer
113views Algorithms» more  COCO 2009»
15 years 11 months ago
Are PCPs Inherent in Efficient Arguments?
Starting with Kilian (STOC ‘92), several works have shown how to use probabilistically checkable proofs (PCPs) and cryptographic primitives such as collision-resistant hashing to...
Guy N. Rothblum, Salil P. Vadhan
CSL
1990
Springer
15 years 9 months ago
On the Reduction Theory for Average Case Complexity
This is an attempt to simplify and justify the notions of deterministicand randomized reductions, an attempt to derive these notions from (more or less) rst principles.
Andreas Blass, Yuri Gurevich
QEST
2007
IEEE
15 years 11 months ago
GRIP: Generic Representatives in PRISM
We give an overview of GRIP, a symmetry reduction tool for the probabilistic model checker PRISM, together with experimental results for a selection of example specifications. 1 ...
Alastair F. Donaldson, Alice Miller, David Parker