796 search results - page 45 / 160 » The Anonymous Subgraph Problem |
93
Voted
CCS
2008
ACM
15 years 2 months ago
2008
ACM
A considerable number of anonymous RFID authentication schemes have been proposed. However, current proposals either do not provide robust security guarantees, or suffer from scal...
85
Voted
COCOA
2008
Springer
15 years 2 months ago
2008
Springer
A popular model for protecting privacy when person-specific data is released is k-anonymity. A dataset is k-anonymous if each record is identical to at least (k - 1) other records ...
98
Voted
IWSEC
2007
Springer
15 years 6 months ago
2007
Springer
At Indocrypt 2005, Viet et al., [22] have proposed an anonymous password-authenticated key exchange (PAKE) protocol and its threshold construction both of which are designed for cl...
99
Voted
IPCO
2010
15 years 2 months ago
2010
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
100
Voted
ALGORITHMICA
2006
15 years 22 days ago
2006
The k-Leaf Power recognition problem is a particular case of graph power problems: For a given graph it asks whether there exists an unrooted tree--the k-leaf root--with leaves on...