227 search results - page 20 / 46 » On the Reachability Problem in Cryptographic Protocols |
MFCS
1990
Springer
15 years 4 months ago
1990
Springer
We introduce the notion of associative one-way functions and prove that they exist if and only if P 6= NP. As evidence of their utility, we present two novel protocols that apply ...
100
Voted
DSN
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper presents a formal model for asynchronous distributed systems with servers that may exhibit Byzantine faults or crash and subsequently recover. The model is computationa...
99
Voted
ICNP
2006
IEEE
15 years 6 months ago
2006
IEEE
— The Internet’s interdomain routing protocol, BGP, is vulnerable to a number of damaging attacks, which often arise from operator misconfiguration. Proposed solutions with st...
93
Voted
ANTS
2006
Springer
15 years 4 months ago
2006
Springer
This paper suggests a new building block for cryptographic protocols and gives two instantiations of it. The concept is to generate two descriptions of the same group: a public des...
113
Voted
ESORICS
2010
Springer
15 years 18 days ago
2010
Springer
Collaborative optimization problems can often be modeled as a linear program whose objective function and constraints combine data from several parties. However, important applicat...