Sciweavers

37 search results - page 7 / 8
» Optimistic Concurrent Zero Knowledge
Sort
View
EUROCRYPT
2007
Springer
14 years 1 months ago
Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
Abstract. We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [...
Yi Deng, Dongdai Lin
PDIS
1993
IEEE
14 years 1 months ago
Log-Based Directory Resolution in the Coda File System
semantic knowledge all concurrent partitionedAbstract updates to an object must be treated as conflicting, andOptimistic replication is an important technique for merged manually b...
Puneet Kumar, Mahadev Satyanarayanan
IJEIS
2010
80views more  IJEIS 2010»
13 years 7 months ago
Semantics for Accurate Conflict Detection in SMoVer: Specification, Detection and Presentation by Example
In collaborative software development the utilization of Version Control Systems (VCSs) is a must. For this, a multitude of pessimistic as well as optimistic VCSs for model artifa...
Kerstin Altmanninger, Wieland Schwinger, Gabriele ...
FOCS
2000
IEEE
14 years 2 months ago
Zaps and Their Applications
A zap is a two-round, public coin witness-indistinguishable protocol in which the first round, consisting of a message from the verifier to the prover, can be fixed “once and...
Cynthia Dwork, Moni Naor
INFOCOM
2010
IEEE
13 years 8 months ago
A General Algorithm for Interference Alignment and Cancellation in Wireless Networks
—Physical layer techniques have come a long way and can achieve close to Shannon capacity for single pointto-point transmissions. It is apparent that, to further improve network ...
Erran L. Li, Richard Alimi, Dawei Shen, Harish Vis...