Sciweavers

121 search results - page 15 / 25
» Identity-based key agreement protocols from pairings
Sort
View
JAR
2006
107views more  JAR 2006»
13 years 7 months ago
Attacking Group Protocols by Refuting Incorrect Inductive Conjectures
Automated tools for finding attacks on flawed security protocols often fail to quately with group protocols. This is because the abstractions made to improve performance on fixed ...
Graham Steel, Alan Bundy
STOC
2005
ACM
112views Algorithms» more  STOC 2005»
14 years 7 months ago
The complexity of agreement
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
Scott Aaronson
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
13 years 10 months ago
Privacy Amplification with Asymptotically Optimal Entropy Loss
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...
Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostr...
ACISP
2010
Springer
13 years 9 months ago
One-Time-Password-Authenticated Key Exchange
To reduce the damage of phishing and spyware attacks, banks, governments, and other security-sensitive industries are deploying one-time password systems, where users have many pa...
Kenneth G. Paterson, Douglas Stebila
TCC
2007
Springer
104views Cryptology» more  TCC 2007»
14 years 1 months ago
Unifying Classical and Quantum Key Distillation
Assume that two distant parties, Alice and Bob, as well as an adversary, Eve, have access to (quantum) systems prepared jointly according to a tripartite state ρABE. In addition, ...
Matthias Christandl, Artur Ekert, Michal Horodecki...