Sciweavers

1195 search results - page 167 / 239
» New constructions of SSPDs and their applications
Sort
View
EUROCRYPT
2008
Springer
15 years 8 months ago
Almost-Everywhere Secure Computation
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
Juan A. Garay, Rafail Ostrovsky
SSWMC
2004
15 years 7 months ago
A hybrid scheme for encryption and watermarking
Encryption and watermarking are complementary lines of defense in protecting multimedia content. Recent watermarking techniques have therefore been developed independent from encr...
Xiaowei Xu, Scott D. Dexter, Ahmet M. Eskicioglu
FIW
1998
130views Communications» more  FIW 1998»
15 years 7 months ago
A Heuristic Approach to Detect Feature Interactions in Requirements
We present a method to systematically detect feature interactions in requirements, which are expressed as constraints on system event traces. We show its application on the lift sy...
Maritta Heisel, Jeanine Souquières
NIPS
1990
15 years 7 months ago
Bumptrees for Efficient Function, Constraint and Classification Learning
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
Stephen M. Omohundro
ICFP
2010
ACM
15 years 7 months ago
Instance chains: type class programming without overlapping instances
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...
J. Garrett Morris, Mark P. Jones