Sciweavers

198 search results - page 9 / 40
» Weak Probabilistic Anonymity
Sort
View
IANDC
2010
116views more  IANDC 2010»
13 years 7 months ago
Weak bisimulation is sound and complete for pCTL*
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
Josée Desharnais, Vineet Gupta, Radha Jagad...
INFOCOM
2009
IEEE
14 years 3 months ago
An Evaluation of Weak State Mechanism Design for Indirection in Dynamic Networks
—State signaling and maintenance mechanisms play crucial roles in communication network protocols. State is used to facilitate indirections in protocols such as routing. Design a...
Utku Gunay Acer, Alhussein A. Abouzeid, Shivkumar ...
ESAS
2007
Springer
14 years 3 months ago
Direct Anonymous Attestation (DAA): Ensuring Privacy with Corrupt Administrators
The Direct Anonymous Attestation (DAA) scheme provides a means for remotely authenticating a trusted platform whilst preserving the user’s privacy. The protocol has been adopted ...
Ben Smyth, Mark Ryan, Liqun Chen
HICSS
2002
IEEE
114views Biometrics» more  HICSS 2002»
14 years 2 months ago
The Effects of Culture in Anonymous Negotiations: Experiment in Four Countries
Internet technologies are increasingly used in various forms of communication, including negotiations. This paper explores the cultural implications in anonymous inter- and intra-...
Gregory E. Kersten, Sabine T. Köszegi, Rudolf...
CORR
2008
Springer
89views Education» more  CORR 2008»
13 years 9 months ago
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilisti...
Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand...