227 search results - page 44 / 46 » On the Reachability Problem in Cryptographic Protocols |
94
Voted
MOC
2010
14 years 5 months ago
2010
We define the weight of an integer N to be the smallest w such that N can be represented as w i=1 i2ci , with 1,..., w{1,-1}. Since arithmetic modulo a prime of low weight is parti...
TCC
2010
Springer
15 years 5 months ago
2010
Springer
Introduced by Micali, Rabin and Kilian (MRK), the basic primitive of zero-knowledge sets (ZKS) allows a prover to commit to a secret set S so as to be able to prove statements such...
96
Voted
SAC
2006
ACM
15 years 4 months ago
2006
ACM
In a recent work, we have shown that it is not possible to dependably build any type of distributed f fault or intrusiontolerant system under the asynchronous model. This result f...
DAC
2004
ACM
15 years 11 months ago
2004
ACM
The growing number of instances of breaches in information security in the last few years has created a compelling case for efforts towards secure electronic systems. Embedded sys...
85
Voted
STOC
2007
ACM
15 years 10 months ago
2007
ACM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...