25,855 Hits in 7.1 sec

Limited Verifier Signature from Bilinear Pairings [chapter]

Xiaofeng Chen, Fangguo Zhang, Kwangjo Kim
2004 Lecture Notes in Computer Science  
However, the judge cannot transfer this proof to convince any other party. Also, the limited verifier signature should be converted into an ordinary one for public verification if required.  ...  In this paper, we first present the precise definition and clear security notions for (convertible) limited verifier signature, and then propose two efficient (convertible) limited verifier signature schemes  ...  Acknowledgement The authors are grateful to the anonymous reviewers for their valuable suggestions and comments to this paper.  ... 
doi:10.1007/978-3-540-24852-1_10 fatcat:lhxw4jmzrza43aayn6we4d73k4

Convertible Group Undeniable Signatures [chapter]

Yuh-Dauh Lyuu, Ming-Luen Wu
2003 Lecture Notes in Computer Science  
In this paper, we propose a convertible group undeniable signature scheme in which the group manager can turn all or selective signatures, which are originally group undeniable signatures, into ordinary  ...  The proposed scheme also allows the group manager to delegate the ability to confirm and deny to a limited set of parties without providing them the capability of generating signatures.  ...  A group undeniable signature scheme can totally be converted into an ordinary group signature scheme by releasing the universal receipt. Universal verification.  ... 
doi:10.1007/3-540-36552-4_4 fatcat:3mlopgphlzabnjt36p3f5whlqq

Using SMT solvers to automate design tasks for encryption and signature schemes

Joseph A. Akinyele, Matthew Green, Susan Hohenberger
2013 Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13  
The AutoStrong tool focuses on the security of digital signature schemes by automatically converting an existentially unforgeable signature scheme into a strongly unforgeable one.  ...  AutoGroup converts a pairingbased encryption or signature scheme written in (simple) symmetric group notation into a specific instantiation in the more efficient, asymmetric setting.  ...  The authors are also grateful to Avi Rubin and Matthew Pagano for helpful discussions.  ... 
doi:10.1145/2508859.2516718 dblp:conf/ccs/Akinyele0H13 fatcat:v7ue3uqqdzeize57yy5di3iojm

Weighted threshold ECDSA for securing bitcoin wallet

Pratyush Dikshit, Kunwar Singh
2016 ACCENTS Transactions on Information Security  
Conflicts of interest The authors have no conflicts of interest to declare.  ...  A ( )threshold signature scheme distributes signing power to players. Any group of at least players can generate a signature, whereas a group of less than cannot.  ...  [7] proposed a scheme as a solution to the problem of bitcoin wallet. That scheme uses elliptic curve digital signature algorithm using threshold signature protocol.  ... 
doi:10.19101/tis.2017.26003 fatcat:ikrvs3uzrnerviw74nd2zopb5i

Controllable Ring Signatures and Its Application to E-Prosecution

Wei Gao, Guilin Wang, Xueli Wang, Dongqing Xie
2013 Journal of Computers  
are generated by the same anonymous signer. (3) Convertibility: the real signer can convert a ring signature into an ordinary signature by revealing the secret information about the ring signature.  ...  We construct a controllable ring signature scheme which is provably secure according to the formal definition.  ...  We would like to express our gratitude thanks to the anonymous referees of WISA 2006 for their invaluable suggestions to improve this paper.  ... 
doi:10.4304/jcp.8.4.833-841 fatcat:5xka2snexndlliujr3ntkhvwzq

Generic constructions for secure and efficient confirmer signature schemes [chapter]

Markus Michels, Markus Stadler
1998 Lecture Notes in Computer Science  
In contrast to ordinary digital signatures, the verification of undeniable signatures and of confirmer signatures requires the cooperation of the signer or of a designated confirmer, respectively.  ...  The constructions employ a new tool called confirmer commitment schemes. In this concept the ability to open the committed value is delegated to a designated confirmer.  ...  Acknowledgements The authors would like to thank the anonymous referees for very useful comments. This research was supported by the Swiss National Foundation (SNF/SPP project no. 5003-045293).  ... 
doi:10.1007/bfb0054142 fatcat:ub4gcy7urvh7bnzqvgg4fqhkua

Group blind digital signatures: A scalable solution to electronic cash [chapter]

Anna Lysyanskaya, Zulfikar Ramzan
1998 Lecture Notes in Computer Science  
In this paper we construct a practical group blind signature scheme. Our scheme combines the already existing notions of blind signatures and group signatures.  ...  We show how to use our group blind signatures to construct an electronic cash system in which multiple banks can securely distribute anonymous and untraceable e-cash.  ...  The second author would like to acknowledge the support of DARPA grant DABT63-96-C-0018. In addition, we thank Ron Rivest for helping us shape our random ideas into a coherent paper.  ... 
doi:10.1007/bfb0055483 fatcat:haiu42vfpbgj7eax4ann3xpemu

On the Security of Two Threshold Signature Schemes with Traceable Signers [chapter]

Guilin Wang, Xiaoxi Han, Bo Zhu
2003 Lecture Notes in Computer Science  
A (t, n) threshold signature scheme allows t or more group members to generate signatures on behalf of a group with n members, while any t − 1 or less members cannot do the same thing.  ...  We first point out that in fact signers in their schemes are untraceable, since anybody can convert a valid threshold signature into a new one such that another subset of group members will be wrongly  ...  We first pointed out that in their schemes the signers of a signature are in fact untraceable, since anybody can convert a valid threshold signature into a new one for the same message.  ... 
doi:10.1007/978-3-540-45203-4_9 fatcat:no52tobpdjayrlkfkknpyepst4

Security Analysis of Two Signcryption Schemes [chapter]

Guilin Wang, Robert H. Deng, DongJin Kwak, SangJae Moon
2004 Lecture Notes in Computer Science  
In this paper, we present a security analysis of two such schemes: the Huang-Chang convertible signcryption scheme [12] , and the Kwak-Moon group signcryption scheme [13] .  ...  Signcryption is a new cryptographic primitive that performs signing and encryption simultaneously, at a cost significantly lower than that required by the traditional signature-then-encryption approach  ...  Our results showed that the convertible signcryption scheme [12] fails to provide confidentiality, and the first group signcryption scheme [13] is insecure.  ... 
doi:10.1007/978-3-540-30144-8_11 fatcat:7mhpfypscbgujmidbgzg5eykge

How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature [chapter]

Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang
2006 Lecture Notes in Computer Science  
Hence it is natural to ask whether one can obtain a truly generic efficient transform based on any randomised trapdoor hash function which converts any weakly unforgeable signature into a strongly unforgeable  ...  At PKC2006, Boneh Shen and Waters presented an efficient transform based on any randomised trapdoor hash function which converts a weakly unforgeable signature into a strongly unforgeable signature and  ...  The authors would like to thank Duncan Wong for interesting discussions and the anonymous referees for their useful comments.  ... 
doi:10.1007/11967668_23 fatcat:hvpla62uqfhi7fvzuytrnzfe5q

Scalable authentication of MPEG-4 streams

Yongdong Wu, R.H. Deng
2006 IEEE transactions on multimedia  
A prominent feature of our schemes is their "sign once, verify many ways" property, i.e., they generate only one digital signature per compressed MPEG-4 object group, but allow clients to verify the authenticity  ...  of any down-scaled version of the original signed object group.  ...  All the three schemes perform the following operations: 1) video objects are assembled into object groups and each object group is encapsulated into a packet group; 2) one digital signature per packet  ... 
doi:10.1109/tmm.2005.861283 fatcat:u2vvjxwawzge7fjdmm5eamcqqu

How to Make Efficient Fail-stop Signatures [chapter]

Eugène van Heyst, Torben Pryds Pedersen
1993 Lecture Notes in Computer Science  
Furthermore a construction is shown of an undeniable signature scheme, which is unconditionally secure for thc signer, and which allows the signer LO convert undeniable signnturcs into fail-stop signatures  ...  This paper presents a fail-stop signature scheme, in which signing a message block requires two modular multiplications and verification requires less than two modular exponentiations.  ...  Acknowledgements We wish to thank Birgit Pfitzmann for many discussions about fail-stop signatures and her comments to this paper.  ... 
doi:10.1007/3-540-47555-9_30 fatcat:icuheuc75vaavlxvz4az4u6u2y

Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures

Jung Min Park, Edwin K. P. Chong, Howard Jay Siegel
2003 Proceedings of the twenty-second annual symposium on Principles of distributed computing - PODC '03  
Specifically, we employ multisignatures based on the RSA-signature scheme.  ...  Furthermore, our scheme uses multisignatures that are compatible with the underlying standard (single-signer) signature scheme, which makes it possible to readily integrate the fair-exchange feature with  ...  Abell Endowment, and by NSF under grants 0098089-ECS, 0099137-ANI, and ANI-0207892.  ... 
doi:10.1145/872035.872060 dblp:conf/podc/ParkCS03 fatcat:f5qedtyvszal3cb4iq6nza6sde

Digital signcryption or how to achieve cost(signature & encryption) ≪ cost(signature) + cost(encryption) [chapter]

Yuliang Zheng
1997 Lecture Notes in Computer Science  
The current standard method to a~hieve this aim is "(digital) signature followed by encryption'.  ...  In particular, we discover a new cryptographie primitive termed as "signcryption" which simultaneously fulfills both the functions of digital signature and public key encryption in a logically single step  ...  In the full paper we also show how to adapt a signcryption scheme into one for broadcast communication which involves multiple recipients.  ... 
doi:10.1007/bfb0052234 fatcat:n5ewdyb2gbeppc4u5ukwjlnlxy

Unconditionally Secure Digital Signature Schemes Admitting Transferability [chapter]

Goichiro Hanaoka, Junji Shikata, Yuliang Zheng, Hideki Imai
2000 Lecture Notes in Computer Science  
More specifically, we establish a model for unconditionally secure digital signatures in a group, and demonstrate practical schemes in that model.  ...  In this work, we focus on signature schemes whose security does not rely on any unproven assumption.  ...  The first author was supported by a Research Fellowship from JSPS. The authors would like to thank Tsutomu Matsumoto and Tsuyoshi Nishioka for their valuable comments.  ... 
doi:10.1007/3-540-44448-3_11 fatcat:5fjky6hchfdfzbruvwmmasjenu
« Previous Showing results 1 — 15 out of 25,855 results