152 search results - page 12 / 31 » Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use |
124
click to vote
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
100
click to vote
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veriļ...
96
Voted
DATE
2007
IEEE
15 years 6 months ago
2007
IEEE
ā It has been the conventional assumption that, due to the superlinear dependence of leakage power consumption on temperature, and widely varying on-chip temperature proļ¬les, a...
111
click to vote
LPAR
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. To produce a program guaranteed to satisfy a given speciļ¬cation one can synthesize it from a formal constructive proof that a computation satisfying that speciļ¬cation...
124
Voted
ICWS
2009
IEEE
14 years 10 months ago
2009
IEEE
The WS-BPEL specification focuses on business processes the activities of which are assumed to be interactions with Web services. However, WS-BPEL processes go beyond the orchestr...