Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,238,762 papers from all fields of science
Search
Sign In
Create Free Account
Undeniable signature
Undeniable signature is a digital signature scheme and implementation invented by David Chaum and Hans van Antwerpen in 1989. In this scheme, a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Cryptographic protocol
Designated verifier signature
Digital signature
Non-repudiation
Broader (1)
Cryptography
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Isogeny-Based Quantum-Resistant Undeniable Signatures
David Jao
,
Vladimir Soukharev
Post-Quantum Cryptography
2014
Corpus ID: 15492991
We propose an undeniable signature scheme based on elliptic curve isogenies, and prove its security under certain reasonable…
Expand
2010
2010
An Efficient Convertible Undeniable Signature Scheme with Delegatable Verification
Jacob C. N. Schuldt
,
Kanta Matsuura
Information Security Practice and Experience
2010
Corpus ID: 14726359
Undeniable signatures, introduced by Chaum and van Antwerpen, require a verifier to interact with the signer to verify a…
Expand
Review
2007
Review
2007
Toward a Product System Modularity Construct: Literature Review and Reconceptualization
F. Salvador
IEEE transactions on engineering management
2007
Corpus ID: 23124042
Product modularity has been discussed in engineering and management literature for over forty years. During this time span…
Expand
Highly Cited
2004
Highly Cited
2004
Identity Based Undeniable Signatures
Benoît Libert
,
J. Quisquater
The Cryptographer's Track at RSA Conference
2004
Corpus ID: 47325046
In this paper, we give a first example of identity based undeniable signature using pairings over elliptic curves. We extend to…
Expand
2000
2000
Beyond the Dialectic of Work and Play: A Serio-Ludic Rhetoric for Composition Studies
Albert Rouzie
2000
Corpus ID: 141219902
In a computersandwritinglistservdiscussiona fewyears ago,the topic of play provoked an interesting eruption of discourse. One…
Expand
Highly Cited
1997
Highly Cited
1997
RSA-Based Undeniable Signatures
R. Gennaro
,
H. Krawczyk
,
T. Rabin
Journal of Cryptology
1997
Corpus ID: 2497022
We present the first undeniable signatures scheme based on RSA. Since their introduction in 1989 a significant amount of work has…
Expand
Highly Cited
1996
Highly Cited
1996
New Convertible Undeniable Signature Schemes
I. Damgård
,
Torben P. Pedersen
International Conference on the Theory and…
1996
Corpus ID: 206643890
Undeniable signatures are like ordinary digital signatures, except that testing validity of a signature requires interaction with…
Expand
Highly Cited
1991
Highly Cited
1991
Weakness of Undeniable Signature Schemes (Extended Abstract)
Y. Desmedt
,
M. Yung
International Conference on the Theory and…
1991
Corpus ID: 41465604
The nice concept of undeniable signatures was presented by Chaum and van Antwerpen [10]. In [7] Chaum mentioned that "with…
Expand
1991
1991
Weakness of Undeniable Signature Schemes (Extended Abstract).
Y. Desmedt
,
M. Yung
1991
Corpus ID: 59865059
The nice concept of undeniable signatures was presented by Chaum and van Antwerpen [lo]. In [7] Chaum mentioned that “with…
Expand
Highly Cited
1990
Highly Cited
1990
Convertible Undeniable Signatures
J. Boyar
,
D. Chaum
,
I. Damgård
,
Torben P. Pedersen
Annual International Cryptology Conference
1990
Corpus ID: 31558706
We introduce a new concept called convertible undeniable signature schemes. In these schemes, release of a single bit string by…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE