Filters








283 Hits in 5.5 sec

A Practical and Provably Secure Coalition-Resistant Group Signature Scheme [chapter]

Giuseppe Ateniese, Jan Camenisch, Marc Joye, Gene Tsudik
2000 Lecture Notes in Computer Science  
This work introduces a new provably secure group signature and a companion identity escrow scheme that are significantly more efficient than the state of the art.  ...  In its interactive, identity escrow form, our scheme is proven secure and coalition-resistant under the strong RSA and the decisional Diffie-Hellman assumptions.  ...  Our new (group signature) scheme improves on the state-of-the-art exemplified by the scheme of Camenisch and Michels [CM98a] which is the only known scheme whose coalition-resistance is provable under  ... 
doi:10.1007/3-540-44598-6_16 fatcat:55hnkhksbvbk3jtvkegnyy272u

Page 7756 of Mathematical Reviews Vol. , Issue 2002J [page]

2002 Mathematical Reviews  
Hwang (Ottawa, ON) 2002):94051 94A62 Ateniese, Giuseppe (1-JHOP-C; Baltimore, MD); Camenisch, Jan (CH-IBM; Riischlikon); Joye, Mare; Tsudik, Gene (1-CA3-C; Irvine, CA) A practical and provably secure coalition-resistant  ...  This work introduces a new provably secure group signature and a companion identity escrow scheme that are significantly more efficient than the state of the art.  ... 

A Provably Secure Aggregate Signature Scheme for Healthcare Wireless Sensor Networks

Limin Shen, Jianfeng Ma, Ximeng Liu, Meixia Miao
2016 Journal of medical systems  
Thus, for the construction of an aggregate signature scheme, besides the secure basic signature scheme, a secure aggregate algorithm resistant to coalition attacks is an imperative problem to be solved  ...  -We give a new aggregate signature scheme for HWSNs based on the schemes [7, 10] , Our scheme not only keeps the basic signature scheme's good feature, but also resists coalition attacks.  ... 
doi:10.1007/s10916-016-0613-3 pmid:27696174 fatcat:q3wer3yjjfarfiu32wdp4fprjy

Extracting Group Signatures from Traitor Tracing Schemes [chapter]

Aggelos Kiayias, Moti Yung
2003 Lecture Notes in Computer Science  
This scheme is the first provably secure group signature scheme whose signature size is not proportional to the size of the group and is based only on DDH and a random oracle.  ...  Without the random oracle assumption our schemes give rise to provably secure and efficient Identity Escrow schemes.  ...  This new outlook leads to new design methodologies for group signatures that allow us to answer an open question in the area and build the first provably secure group signature scheme whose size is independent  ... 
doi:10.1007/3-540-39200-9_39 fatcat:aqtbceuxvnekjl4l3yqfmdj4ye

A Provably Secure Certificateless Aggregate Signature Scheme with Designated Verifier in An Improved Security Model

Limin Shen, Jianfeng Ma, Yinbin Miao, Hai Liu
2018 IET Information Security  
In this study, the authors provide a modified security model of certificateless AS (CLAS) schemes and then give a new CLAS scheme.  ...  Many previous attempts have been made for designing AS schemes, while the former security models have not clearly addressed coalition attacks, and most of the existing AS schemes cannot resist these kinds  ...  Thus, our model can resist a kind of practical and powerful attacks named coalition attacks.  ... 
doi:10.1049/iet-ifs.2018.5226 fatcat:xmn23xy53vgxvjuw6i6yde5swy

Cryptanalysis and Improvement of Three Certificateless Aggregate Signature Schemes

Xiaodong Yang, Yutong Li, Chunlin Chen, Likun Xiao, Caifen Wang
2018 Mathematical Problems in Engineering  
Du et al. proposed a CLAS scheme with the constant aggregate signature length and claimed that their scheme was resistant to forgery attacks.  ...  Many CLAS schemes have been proposed in recent years, but the construction of a secure and efficient CLAS scheme remains important.  ...  This requires that a secure CLAS scheme should be able to resist coalition attacks. Unfortunately, we note that Li et al.'s CLAS scheme [15] , Du et al.'s CLAS scheme [17] , and Chen et al.'  ... 
doi:10.1155/2018/1908632 fatcat:uycgfslwdzclrnmf5rqx5sg2m4

Security Flaws in Several Group Signatures Proposed by Popescu [chapter]

Guilin Wang, Sihan Qing
2005 Lecture Notes in Computer Science  
In resent years, Popescu proposed several group signature schemes based on the Okamoto-Shiraishi assumption in [8] [9] [10] [11] , and claimed his schemes are secure.  ...  That is, anybody (not necessarily a group member) can forge valid group signatures on arbitrary messages of his/her choice.  ...  Later, Ateniese et al. presented a practical and provably secure coalition-resistant group signature scheme [1] .  ... 
doi:10.1007/11424857_78 fatcat:f4io2saa5jd7njwpywk36uglbu

An Efficient and Secure Dynamic Group Signature Scheme

Ye-Feng HE
2005 Journal of Software (Chinese)  
An efficient and secure dynamic group signature scheme. Journal of Software, 2005,16(4): 609−615.  ...  Abstract: To improve the efficiency of group signature, an efficient and secure dynamic group signature scheme is proposed based on the ELGamal encryption and signature of knowledge.  ...  Security of the Proposed Scheme Our scheme is secure and coalition-resistant under the RSA and decisional Diffie-Hellman assumptions [4] .  ... 
doi:10.1360/jos160609 fatcat:7vbqtsfnrneb3fvfp7a4sndome

Page 10579 of Mathematical Reviews Vol. , Issue 2004m [page]

2004 Mathematical Reviews  
Then we provide extensions to make ring signatures suitable in practical situations, such as threshold schemes or ad- hoc groups.  ...  Finally we propose an efficient scheme for threshold scenarios based on a combinatorial method and provably secure in the random oracle model.”  ... 

Fair Identification [chapter]

Omkant Pandey, Julien Cathalo, Jean-Jacques Quisquater
2006 Lecture Notes in Computer Science  
We propose a security model and a provably secure optimistic fair identification protocol.  ...  This paper studies a new problem called fair identification: given two parties, how should they identify each other in a fair manner.  ...  Acknowledgements The authors wish to thank Benoît Libert and Judyta Stachniak for their suggestions and ideas and Sylvie Baudine for her permanent English support.  ... 
doi:10.1007/11605805_4 fatcat:xb6khvwbwrftznvpe5zvddswrq

The Blob: provable incompressibility and traceability in the whitebox model [article]

Boris Skoric, Wil Michiels
2020 arXiv   pre-print
We introduce a scheme for distributing and storing software with cryptographic functionality in the whitebox attacker model.  ...  Our scheme satisfies two relevant properties: incompressibility and traceability.  ...  For instance, in typical group signatures the crypto and the tracing are not postquantum secure.  ... 
arXiv:2004.04457v1 fatcat:b5sge7rnavam7mgjp6ly6fowyq

Privacy-preserving security solution for cloud services

L. Malina, J. Hajny, P. Dzurenda, V. Zeman
2015 Journal of Applied Research and Technology  
Our solution is based on an efficient nonbilinear group signature scheme providing the anonymous access to cloud services and shared storage servers.  ...  Further, we analyzecurrent privacy preserving solutions for cloud services and group signature schemes as basic parts of privacy enhancing solutions in cloud services.  ...  Acknowledgments This research work is funded by project SIX CZ.1.05/2.1.00/03.0072; the Technology Agency of the Czech Republic projects TA02011260 and TA03010818; the Ministry of Industry and Trade of  ... 
doi:10.1016/s1665-6423(15)30002-x fatcat:zfxcb67cuzduvphn5b5xu4bv44

An Electronic Cash System Based on Group Blind Signatures

Constantin Popescu
2006 Informatica  
In this paper we improve these electronic cash systems to prevent blackmailing, money laundering and illegal purchases by using a secure coalition-resistant group blind signature scheme.  ...  In their payment system, they used a group signature scheme of Camenisch and Stadler for large groups which is not secure.  ...  by using a practical and secure coalition-resistant group blind signature scheme (Popescu, 2003) .  ... 
doi:10.15388/informatica.2006.154 fatcat:ug6np7ddsfg6flnwh4oqwvnnd4

Certificateless-Based Anonymous Authentication and Aggregate Signature Scheme for Vehicular Ad Hoc Networks

Xin Ye, Gencheng Xu, Xueli Cheng, Yuedi Li, Zhiguang Qin, Zhuojun Duan
2021 Wireless Communications and Mobile Computing  
Furthermore, it demonstrates that when focused on the existential forgery on adaptive chosen message attack and coalition attack, the proposed schemes can be proved secure.  ...  certificateless signature (CLS), and CL-AS schemes.  ...  By comprision, our scheme has low time complexity and high efficiency. In addition, our scheme can resist coalition attacks, which are a special and security feature that no other scheme has.  ... 
doi:10.1155/2021/6677137 fatcat:idjsyn7lkrhnxlhdfarxiayzu4

Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions [chapter]

Mihir Bellare, Daniele Micciancio, Bogdan Warinschi
2003 Lecture Notes in Computer Science  
Finally we prove the existence of a construct meeting our definitions based only on the sole assumption that trapdoor permutations exist. 2 Definitions of the security of group signature schemes Notation  ...  This paper provides theoretical foundations for the group signature primitive. We introduce strong, formal definitions for the core requirements of anonymity and traceability.  ...  The second and third authors are supported in part by NSF CAREER Award CCR-0093029.  ... 
doi:10.1007/3-540-39200-9_38 fatcat:7gpvjwoonfgolomifd55eja6qi
« Previous Showing results 1 — 15 out of 283 results