Sciweavers

30 search results - page 6 / 6
» 3-Move Undeniable Signature Scheme
Sort
View
CTRSA
2004
Springer
120views Cryptology» more  CTRSA 2004»
13 years 10 months ago
Identity Based Undeniable Signatures
Abstract. In this paper, we give a first example of identity based undeniable signature using pairings over elliptic curves. We extend to the identity based setting the security m...
Benoît Libert, Jean-Jacques Quisquater
CRYPTO
1998
Springer
106views Cryptology» more  CRYPTO 1998»
13 years 9 months ago
New Efficient and Secure Protocols for Verifiable Signature Sharing and Other Applications
Verifiable Signature Sharing (VS ) enables the recipient of a digital signature, who is not necessarily the original signer, to share such signature among n proxies so that a subse...
Dario Catalano, Rosario Gennaro
PKC
2001
Springer
95views Cryptology» more  PKC 2001»
13 years 9 months ago
The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes
This paper introduces a novel class of computational problems, the gap problems, which can be considered as a dual to the class of the decision problems. We show the relationship a...
Tatsuaki Okamoto, David Pointcheval
ASIACRYPT
1999
Springer
13 years 9 months ago
How to Prove That a Committed Number Is Prime
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...
Tri Van Le, Khanh Quoc Nguyen, Vijay Varadharajan
CHES
2009
Springer
140views Cryptology» more  CHES 2009»
14 years 6 months ago
On Tamper-Resistance from a Theoretical Viewpoint
Tamper-proof devices are pretty powerful. They can be used to have better security in applications. In this work we observe that they can also be maliciously used in order to defea...
Paulo Mateus, Serge Vaudenay