Sciweavers

2237 search results - page 239 / 448
» On the Security of Random Sources
Sort
View
IJNSEC
2006
113views more  IJNSEC 2006»
15 years 7 months ago
Cryptanalysis of Park's Authentication Protocol in Wireless Mobile Communication Systems
In 2004, C. Park proposed an authentication protocol to provide user anonymity and untraceability in wireless mobile communication systems. The real user identities are hidden and...
Alberto Peinado Domínguez
ASIACRYPT
2010
Springer
15 years 5 months ago
Short Pairing-Based Non-interactive Zero-Knowledge Arguments
We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero-knowledge and computational soundness. The non-interactive ...
Jens Groth
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
16 years 1 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
INFOCOM
2007
IEEE
16 years 1 months ago
Paradox of Shortest Path Routing for Large Multi-Hop Wireless Networks
— In this paper, we analyze the impact of straight line routing in large homogeneous multi-hop wireless networks. We estimate the nodal load, which is defined as the number of p...
Sungoh Kwon, Ness B. Shroff
COCO
2007
Springer
93views Algorithms» more  COCO 2007»
16 years 1 months ago
S-T Connectivity on Digraphs with a Known Stationary Distribution
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
Kai-Min Chung, Omer Reingold, Salil P. Vadhan