Sciweavers

664 search results - page 2 / 133
» Solution to the Counterfeit Coin Problem and its Generalizat...
Sort
View
FC
2000
Springer
127views Cryptology» more  FC 2000»
13 years 9 months ago
Blind, Auditable Membership Proofs
Auditability is an important property in nancial systems and architectures. Here we de ne the primitive of blind auditable membership proof" BAMP which combines public auditab...
Tomas Sander, Amnon Ta-Shma, Moti Yung
KDD
2009
ACM
204views Data Mining» more  KDD 2009»
14 years 6 months ago
DOULION: counting triangles in massive graphs with a coin
Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analy...
Charalampos E. Tsourakakis, U. Kang, Gary L. Mille...
FCT
2007
Springer
13 years 12 months ago
A Novel Information Transmission Problem and Its Optimal Solution
We propose and study a new information transmission problem motivated by today’s internet. A real number, perhaps representing control information in a network, is encoded using...
Eric Bach, Jin-yi Cai
SAS
2005
Springer
13 years 11 months ago
Secure Information Flow as a Safety Problem
The termination insensitive secure information flow problem can be reduced to solving a safety problem via a simple program transformation. Barthe, D’Argenio, and Rezk coined th...
Tachio Terauchi, Alexander Aiken
ESA
2003
Springer
124views Algorithms» more  ESA 2003»
13 years 11 months ago
The Minimum Generalized Vertex Cover Problem
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
Refael Hassin, Asaf Levin