Sciweavers

505 search results - page 20 / 101
» Message from General Co-Chairs
Sort
View
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
14 years 9 months ago
Concurrent general composition of secure protocols in the timing model
In the setting of secure multiparty computation, a set of parties wish to to jointly compute some function of their input (i.e., they wish to securely carry out some distributed t...
Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakar...
IANDC
2007
84views more  IANDC 2007»
13 years 9 months ago
The perfectly synchronized round-based model of distributed computing
ectly-synchronized round-based model provides the powerful abstraction of op failures with atomic and synchronous message delivery. This abstraction makes distributed programming ...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
CSFW
2012
IEEE
11 years 11 months ago
Securing Interactive Programs
Abstract—This paper studies the foundations of informationflow security for interactive programs. Previous research assumes that the environment is total, that is, it must alway...
Willard Rafnsson, Daniel Hedin, Andrei Sabelfeld
ICDAR
1997
IEEE
14 years 1 months ago
The Function of Documents
The purpose of a document is to facilitate the transfer of information from its author to its readers. It is the author’s job to design the document so that the information it c...
David S. Doermann, Azriel Rosenfeld, Ehud Rivlin
SRDS
2003
IEEE
14 years 2 months ago
Distributed Programming for Dummies: A Shifting Transformation Technique
The perfectly synchronized round model provides the abstraction of crash-stop failures with atomic message delivery. This abstraction makes distributed programming very easy. We p...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...