85 search results - page 8 / 17 » Commitment Schemes and Zero-Knowledge Protocols |
ASIACRYPT
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. The problem of proving a number is of a given arithmetic format with some prime elements, is raised in RSA undeniable signature, group signature and many other cryptograp...
EUROPAR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Transactional memory systems trade ease of programming with runtime performance losses in handling transactions. This paper focuses on starvation effects that show up in ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We propose a coin-flip protocol which yields a string of strong, random coins and is fully simulatable against poly-sized quantum adversaries on both sides. It can be implemented ...
ESOP
2008
Springer
13 years 9 months ago
2008
Springer
In an optimistic approach to security, one can often simplify protocol design by relying on audit logs, which can be analyzed a posteriori. Such auditing is widely used in practice...
TCC
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. In this paper we consider commitment schemes that are secure against concurrent man-in-the-middle (cMiM) attacks. Under such attacks, two possible notions of security for...