241 search results - page 19 / 49 » Machine-Checked Security Proofs of Cryptographic Signature S... |
CRYPTO
1989
Springer
14 years 20 days ago
1989
Springer
Abstract. In this paper, we provide a new approach to study undeniable signatures by translating secure digital signatures to secure undeniable signatures so that the existing algo...
PKC
2007
Springer
14 years 2 months ago
2007
Springer
We give a short constant-size group signature scheme, which we prove fully secure under reasonable assumptions in bilinear groups, in the standard model. We achieve this result by ...
FOCS
1999
IEEE
14 years 27 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...
AFRICACRYPT
2008
Springer
14 years 3 months ago
2008
Springer
Public-key encryption schemes are a useful and interesting field of cryptographic study. The ultimate goal for the cryptographer in the field of public-key encryption would be th...
IJNSEC
2007
13 years 8 months ago
2007
In 2004, Libert and Quisquater proposed an identity based undeniable signature scheme using pairings over elliptic curves. In this article, we show that the scheme is not secure. ...