The Eternal system pioneered the interception approach to providing transparent fault tolerance for CORBA, which allows it to make a CORBA application reliable with little or no modification to the application or the ORB. The design and implementation of the Eternal system has influenced industrial practices by providing the basis for the specifications of the Fault-Tolerant CORBA standard that...

The Eternal system provides transparent fault tolerance for CORBA applications, without requiring the modification of either the application or the ORB. Eternal replicates the application objects, and ensures strong replica consistency by employing a reliable totally-ordered multicast protocol for conveying the IIOP messages of the application. To achieve strong replica consistency during recov...

Private Set Intersection protocols (PSIs) allow parties to compute the intersection of their private sets, such that nothing about sets’ elements beyond is revealed. PSIs have a variety applications, primarily in efficiently supporting data sharing privacy-preserving manner. At Eurocrypt 2019, Ghosh and Nilges proposed three efficient based on polynomial representation sets proved security agai...

We study a problem of secure data storage on hardware that may leak information. We introduce a new primitive, that we call leakage-resilient storage (LRS), which is an (unkeyed) scheme for encoding messages, and can be viewed as a generalization of the All-Or-Nothing Transform (AONT, Rivest 1997). The standard definition of AONT requires that it should be hard to reconstruct a message m if not...

Keywords: Autohan, UPnP, Iota, XML. The home is an eternal, heterogeneous, distributed computing environment which must be secure and reliable. Computers and embedded processors in the home are all different shapes and sizes and ages. Hence the home poses one of the most challenging environments for cooperative programming. We envisage that control software is introduced into the home by four d...

In this paper, we re-visit the problem of unconditionally secure multiparty set intersection in information theoretic model. Li et.al [24] have proposed a protocol for n-party set intersection problem, which provides unconditional security when t < n 3 players are corrupted by an active adversary having unbounded computing power. Moreover, they have claimed that their protocol takes six rounds ...

We re-visit the problem of secure multiparty set intersection in information theoretic settings. In [16], Li et.al have proposed a protocol for multiparty set intersection problem with n parties, that provides information theoretic security, when t < n 3 parties are corrupted by an active adversary having unbounded computing power. In [16], the authors claimed that their protocol takes six roun...