989 search results - page 13 / 198 » Pebbling and Proofs of Work |
AAAI
2008
13 years 10 months ago
2008
One way for agents to reach a joint decision is to vote over the alternatives. In open, anonymous settings such as the Internet, an agent can vote more than once without being det...
TPHOL
2005
IEEE
14 years 1 months ago
2005
IEEE
We show that delaying fully-expansive proof reconstruction for non-interactive decision procedures can result in a more efficient workflow. In contrast with earlier work, our appr...
FOCS
1999
IEEE
14 years 20 days ago
1999
IEEE
We introduce the notion of non-malleable noninteractive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong non-m...
FAC
2008
13 years 8 months ago
2008
This paper describes how the communication protocol of Mondex electronic purses can be specified and verified against desired security properties. The specification is developed by...
EUROCRYPT
2007
Springer
14 years 2 months ago
2007
Springer
Protocols proven secure within the universal composability (UC) framework satisfy strong and desirable security properties. Unfortunately, it is known that within the “plain” m...