Sciweavers

3115 search results - page 456 / 623
» Synthesizing Secure Protocols
Sort
View
STOC
2009
ACM
91views Algorithms» more  STOC 2009»
16 years 6 months ago
Inaccessible entropy
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
Iftach Haitner, Omer Reingold, Salil P. Vadhan, Ho...
IPOM
2009
Springer
16 years 15 days ago
A Feasibility Evaluation on Name-Based Routing
Abstract. The IPv4 addressing scheme has been the standard for Internet communication since it was established in the 1960s. However, the enormous increase in Internet traffic usag...
Haesung Hwang, Shingo Ata, Masayuki Murata
134
Voted
ICCCN
2008
IEEE
16 years 12 days ago
A Preliminary Look at the Privacy of SSH Tunnels
— Secure Shell (SSH) tunnels are commonly used to provide two types of privacy protection to clear-text application protocols. First and foremost, they aim at protecting the priv...
Maurizio Dusi, Francesco Gringoli, Luca Salgarelli
201
Voted
ICQNM
2008
IEEE
201views Chemistry» more  ICQNM 2008»
16 years 11 days ago
Loss-Tolerant Quantum Coin Flipping
Coin flipping is a cryptographic primitive in which two spatially separated players, who in principle do not trust each other, wish to establish a common random bit. If we limit ...
Guido Berlín, Gilles Brassard, Félix...
CRYPTO
2007
Springer
145views Cryptology» more  CRYPTO 2007»
16 years 3 days ago
Chernoff-Type Direct Product Theorems
Consider a challenge-response protocol where the probability of a correct response is at least α for a legitimate user and at most β < α for an attacker. One example is a CAP...
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kab...