Sciweavers

3081 search results - page 600 / 617
» A Formal Ontology of Properties
Sort
View
CSCWD
2001
Springer
15 years 4 months ago
Update Algorithms for the Sketch Data Model
The authors have developed a new approach to database interoperability using the sketch data model. That technique has now been used in a number of applications, but an important ...
Michael Johnson, Robert D. Rosebrugh
94
Voted
EUROCRYPT
2001
Springer
15 years 4 months ago
Cryptographic Counters and Applications to Electronic Voting
We formalize the notion of a cryptographic counter, which allows a group of participants to increment and decrement a cryptographic representation of a (hidden) numerical value pri...
Jonathan Katz, Steven Myers, Rafail Ostrovsky
AC
2000
Springer
15 years 4 months ago
The Join Calculus: A Language for Distributed Mobile Programming
In these notes, we give an overview of the join calculus, its semantics, and its equational theory. The join calculus is a language that models distributed and mobile programming. ...
Cédric Fournet, Georges Gonthier
CRYPTO
2000
Springer
110views Cryptology» more  CRYPTO 2000»
15 years 4 months ago
Parallel Reducibility for Information-Theoretically Secure Computation
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
Yevgeniy Dodis, Silvio Micali
STOC
1999
ACM
101views Algorithms» more  STOC 1999»
15 years 4 months ago
Short Proofs are Narrow - Resolution Made Simple
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
Eli Ben-Sasson, Avi Wigderson