85 search results - page 7 / 17 » Commitment Schemes and Zero-Knowledge Protocols |
ASIACRYPT
2001
Springer
14 years 1 hour ago
2001
Springer
We study the two-party commitment problem, where two players have secret values they wish to commit to each other. Traditional commitment schemes cannot be used here because they d...
CCR
2000
13 years 7 months ago
2000
We propose a zero-knowledge interactive proof based identification and signature scheme. The protocol is based on Euler's totient function and discrete logarithms over the ri...
STOC
2005
ACM
14 years 7 months ago
2005
ACM
We present a new constant round protocol for non-malleable zero-knowledge. Using this protocol as a subroutine, we obtain a new constant-round protocol for non-malleable commitmen...
ICWS
2009
IEEE
13 years 5 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...
MICRO
2010
IEEE
13 years 5 months ago
2010
IEEE
Recently-proposed architectures that continuously operate on atomic blocks of instructions (also called chunks) can boost the programmability and performance of shared-memory mult...