111 search results - page 10 / 23 » Errors in Computational Complexity Proofs for Protocols |
EUROPKI
2009
Springer
13 years 6 months ago
2009
Springer
Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many cryptographic applications such as identification schemes, group signatures, and secure mult...
STOC
2006
ACM
14 years 9 months ago
2006
ACM
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
In this paper, we present a very important primitive called Information Checking Protocol (ICP) which plays an important role in constructing statistical Verifiable Secret Sharing...
FC
2010
Springer
14 years 15 days ago
2010
Springer
—This paper discusses public-key authenticated key agreement protocols. First, we critically analyze several authenticated key agreement protocols and uncover various theoretical...
FMICS
2010
Springer
13 years 8 months ago
2010
Springer
We investigate the application of the software bounded model checking tool CBMC to the domain of wireless sensor networks (WSNs). We automatically generate a software behavior mode...