Sciweavers

2735 search results - page 189 / 547
» Comparing notions of randomness
Sort
View
MFCS
2007
Springer
14 years 4 months ago
Evolvability
A framework for analyzing the computational capabilities and the limitations of the evolutionary process of random change guided by selection was recently introduced by Valiant [V...
Leslie G. Valiant
PROVSEC
2007
Springer
14 years 4 months ago
Stronger Security of Authenticated Key Exchange
In this paper we study security definitions for authenticated key exchange (AKE) protocols. We observe that there are several families of attacks on AKE protocols that lie outsid...
Brian A. LaMacchia, Kristin Lauter, Anton Mityagin
WAW
2007
Springer
120views Algorithms» more  WAW 2007»
14 years 4 months ago
Manipulation-Resistant Reputations Using Hitting Time
Popular reputation systems for linked networks can be manipulated by spammers who strategically place links. The reputation of node v is interpreted as the world’s opinion of v...
John E. Hopcroft, Daniel Sheldon
ACISP
2005
Springer
14 years 4 months ago
Two Improved Partially Blind Signature Schemes from Bilinear Pairings
A blind signature scheme is a protocol for obtaining a digital signature from a signer, but the signer can neither learn the messages he/she sign nor the signatures the recipients ...
Sherman S. M. Chow, Lucas Chi Kwong Hui, Siu-Ming ...
CCS
2005
ACM
14 years 4 months ago
Provable anonymity
This paper provides a formal framework for the analysis of information hiding properties of anonymous communication protocols in terms of epistemic logic. The key ingredient is ou...
Flavio D. Garcia, Ichiro Hasuo, Wolter Pieters, Pe...