Sciweavers

273 search results - page 32 / 55
» Mutually Independent Commitments
Sort
View
79
Voted
SIAMCO
2010
93views more  SIAMCO 2010»
14 years 8 months ago
Small Gain Theorems for Large Scale Systems and Construction of ISS Lyapunov Functions
We consider a network consisting of n interconnected nonlinear subsystems. For each subsystem an ISS Lyapunov function is given that treats the other subsystems as independent inpu...
Sergey Dashkovskiy, Björn Sebastian Rüff...
ICDM
2009
IEEE
130views Data Mining» more  ICDM 2009»
14 years 7 months ago
Efficient Anonymizations with Enhanced Utility
The k-anonymization method is a commonly used privacy-preserving technique. Previous studies used various measures of utility that aim at enhancing the correlation between the orig...
Jacob Goldberger, Tamir Tassa
COCO
2007
Springer
88views Algorithms» more  COCO 2007»
15 years 3 months ago
A New Interactive Hashing Theorem
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major compo...
Iftach Haitner, Omer Reingold
ISCA
2006
IEEE
125views Hardware» more  ISCA 2006»
15 years 3 months ago
Architectural Semantics for Practical Transactional Memory
Transactional Memory (TM) simplifies parallel programming by allowing for parallel execution of atomic tasks. Thus far, TM systems have focused on implementing transactional stat...
Austen McDonald, JaeWoong Chung, Brian D. Carlstro...
DRM
2003
Springer
15 years 2 months ago
Breaking and repairing optimistic fair exchange from PODC 2003
In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair exchange, based on RSA signatures. We show that their protocol is totally breakable already...
Yevgeniy Dodis, Leonid Reyzin