Sciweavers

18090 search results - page 443 / 3618
» Computing by Only Observing
Sort
View
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
16 years 6 days ago
Round-Optimal Secure Two-Party Computation
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
Jonathan Katz, Rafail Ostrovsky
ALT
1998
Springer
15 years 11 months ago
Synthesizing Learners Tolerating Computable Noisy Data
An index for an r.e. class of languages (by definition) generates a sequence of grammars defining the class. An index for an indexed family of recursive languages (by definition) ...
John Case, Sanjay Jain
RECOMB
1998
Springer
15 years 11 months ago
The hierarchical organization of molecular structure computations
The task of computing molecular structure from combinations of experimental and theoretical constraints is expensive because of the large number of estimated parameters (the 3D co...
Cheng Che Chen, Jaswinder Pal Singh, Russ B. Altma...
SIGGRAPH
1995
ACM
15 years 10 months ago
A realistic camera model for computer graphics
Most recent rendering research has concentrated on two subproblems: modeling the reflection of light from materials, and calculating the direct and indirect illumination from lig...
Craig E. Kolb, Don P. Mitchell, Pat Hanrahan
EUROCRYPT
2008
Springer
15 years 8 months ago
Efficient Two Party and Multi Party Computation Against Covert Adversaries
Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure...
Vipul Goyal, Payman Mohassel, Adam Smith