5,747 Hits in 3.4 sec

A New Group Signature Scheme Based on RSA Assumption

Chou-Chen Yang, Ting-Yi Chang, Min-Shiang Hwang
2013 Information Technology and Control  
In this paper, we present a new group signature scheme based on RSA assumption.  ...  It not only achieves the same objective as the Lee-Chang scheme but also reduces the amount of computing time as compared to the Lee-Chang scheme and the Lee-Chang-Hwang scheme.  ...  On the other hand, based on RSA assumption, Cui et al. [9] and Chen et al. [8] separately proposed the group signature scheme.  ... 
doi:10.5755/j01.itc.42.1.1185 fatcat:l2dhf6gnzjdlfmsgrlazti5mvm

Short Signatures from Weaker Assumptions [chapter]

Dennis Hofheinz, Tibor Jager, Eike Kiltz
2011 Lecture Notes in Computer Science  
As another application of PHFs, we propose new and efficient constructions of digital signature schemes from weaker assumptions, i.e., from the (standard, non-strong) RSA and the (standard, non-strong)  ...  Cryptol. 2011) to yield digital signature schemes from the strong RSA and strong q-Diffie-Hellman assumptions.  ...  For example, the schemes in [23, 29, 28, 36, 38, 50] are based on the Strong (or, Flexible) RSA assumption and the schemes in [11, 38, 50] are based on the Strong q-Diffie-Hellman assumption.  ... 
doi:10.1007/978-3-642-25385-0_35 fatcat:vpx3aowo7fd4fnwf7nd4xh62ty

Realizing Hash-and-Sign Signatures under Standard Assumptions [chapter]

Susan Hohenberger, Brent Waters
2009 Lecture Notes in Computer Science  
We achieve two new realizations for hashand-sign signatures respectively based on the RSA assumption and the Computational Diffie-Hellman assumption in bilinear groups.  ...  Moreover, most current instances rely on strong and less studied assumptions such as the Strong RSA and q-Strong Diffie-Hellman assumptions.  ...  Acknowledgments We thank Dan Boneh for valuable discussions, including suggesting the second variant of our RSA scheme described in Section 3.1.  ... 
doi:10.1007/978-3-642-01001-9_19 fatcat:rt6g6wn5rvgcnorik7xqtqb3fm

An Anonymous Authentication Scheme for Identification Card [chapter]

He Ge
2006 Lecture Notes in Computer Science  
We proved our scheme is secure under the strong RSA assumption and the decisional Diffie-Hellman assumption.  ...  The most advantage of our scheme is its simplicity and efficiency such that all computation can be carried out by a resource-limited identification card.  ...  The new scheme is proved to be secure under the strong RSA assumption and the decisional Diffie-Hellman assumption.  ... 
doi:10.1007/11935308_17 fatcat:ysusrcseqnauddi2zuiouptxkq

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  
A group signature scheme allows a group member to sign messages anonymously on behalf of the group.  ...  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.  ...  Conclusions This paper presents a very efficient and provably secure group signature scheme and a companion identity escrow scheme that are based on the strong RSA assumption.  ... 
doi:10.1007/3-540-44598-6_16 fatcat:55hnkhksbvbk3jtvkegnyy272u

Group Signatures: Better Efficiency and New Theoretical Aspects [chapter]

Jan Camenisch, Jens Groth
2005 Lecture Notes in Computer Science  
While these schemes are more efficient, they are based on new and alternative number theoretic assumptions.  ...  All the schemes mentioned here include in their assumptions the strong RSA assumption and the random oracle model.  ...  A Group Signature Scheme Based on One-Way Functions and NIZK ArgumentsWe will present a group signature scheme with full-traceability and anonymity based on the assumptions that one-way functions exist  ... 
doi:10.1007/978-3-540-30598-9_9 fatcat:cbf6pa7gwzfthgcm5yfa325iwa

An Efficient Synchronized Aggregate Signature Scheme From Standard RSA Assumption

Xinshun Guo, Zhiwei Wang
2014 International Journal of Future Generation Communication and Networking  
We proposed an efficient synchronized aggregate signature scheme from the standard RSA assumption. Our construction is based on the Hohenburger and Waters RSA signature (Crypto 09).  ...  An aggregate is a digital signature that supports aggregation where any one given n signatures on n distinct messages from n different users can aggregate all these signatures into a single one.  ...  We present a synchronized aggregate signature under Hohenburger and Waters's RSA signature [8] (Crypto 09). Our scheme is provably secure based on the standard RSA assumption in the standard model.  ... 
doi:10.14257/ijfgcn.2014.7.3.21 fatcat:dvz2xlxy6veodfqovwynelfpuq

A Group Signature Scheme with Efficient Membership Revocation for Reasonable Groups [chapter]

Toru Nakanishi, Yuji Sugiyama
2004 Lecture Notes in Computer Science  
Though group signature schemes with efficient membership revocation were proposed, the previous schemes force a member to obtain a public membership information of O( n N ) bits, where n is the length  ...  Then, for groups with a reasonable size that is comparable to the RSA modulus size (e.g., about 1000 members for 1024 bit RSA modulus), the public membership information is a single small value only, while  ...  Model We show a model of group signature scheme with membership revocation. 3 Preliminaries Assumptions and Notations Our scheme is based on the strong RSA assumption and decisional Diffie-Hellman (DDH  ... 
doi:10.1007/978-3-540-27800-9_29 fatcat:lcxncwrmcff4jmckwoiankmrna

Strong Security from Probabilistic Signature Schemes [chapter]

Sven Schäge
2012 Lecture Notes in Computer Science  
This results in a new efficient RSA-based signature scheme.  ...  We present an instantiation of a target randomness secure signature scheme based on the RSA assumption and show that after applying our new signature transformation to this scheme, we can accumulate the  ...  A Target Randomness Secure Signature Scheme Based on the RSA Assumption Let us now present our new RSA-based EMURUF-GMRA secure signature scheme.  ... 
doi:10.1007/978-3-642-30057-8_6 fatcat:jmtuxig7czbbnj32cp75oc73j4

Short and Stateless Signatures from the RSA Assumption [chapter]

Susan Hohenberger, Brent Waters
2009 Lecture Notes in Computer Science  
A signature in our scheme is comprised of one element in Z * N and one integer.  ...  We present the first signature scheme which is "short", stateless and secure under the RSA assumption in the standard model.  ...  Short, Fully-Secure RSA Signatures We obtain a fully secure signature scheme by combining our RSA-based weakly unforgeable signatures with any suitable chameleon hash function.  ... 
doi:10.1007/978-3-642-03356-8_38 fatcat:qjrggrkn4ncgdabiust267pf4m

Algorithms and Approaches of Proxy Signature: A Survey [article]

Manik Lal Das, Ashutosh Saxena, Deepak B. Phatak
2006 arXiv   pre-print
This survey reviews the research progress on proxy signatures, analyzes a few notable proposals, and provides an overall remark of these proposals.  ...  Numerous research studies have been investigated on proxy signatures over the last decade.  ...  Models of Proxy Signature Based on the security assumptions on various proxy signature schemes, we categorize the existing schemes into four different constructions: DLP-based proxy signature, RSA-based  ... 
arXiv:cs/0612098v1 fatcat:ogiikhtun5flnldt2glq6hvrw4

Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups [chapter]

Ivan Damgård, Maciej Koprowski
2002 Lecture Notes in Computer Science  
As an example of this, we revisit Cramer-Shoup signature scheme [10] . We modify the scheme such that it becomes a generic algorithm.  ...  The results hold for arbitrary groups, so security w.r.t. generic attacks follows for any cryptographic construction based on root extracting.  ...  But the same model also incorporates generic attacks against schemes based on class groups (we elaborate later on this).  ... 
doi:10.1007/3-540-46035-7_17 fatcat:vzvtwsun3fee3kldfl52gpt43e

Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme [chapter]

Alexandra Boldyreva
2002 Lecture Notes in Computer Science  
Our constructions are based on the recently proposed GDH signature scheme of Boneh et al. [8] .  ...  We propose a robust proactive threshold signature scheme, a multisignature scheme and a blind signature scheme which work in any Gap Diffie-Hellman (GDH) group (where the Computational Diffie-Hellman problem  ...  Acknowledgements We thank Mihir Bellare for the useful discussions, for suggesting to consider the topic of threshold signatures.  ... 
doi:10.1007/3-540-36288-6_3 fatcat:7ygbetygwndlxfidwbqehyq3eu

Signature schemes based on the strong RSA assumption

Ronald Cramer, Victor Shoup
1999 Proceedings of the 6th ACM conference on Computer and communications security - CCS '99  
We describe and analyze a new digital signature scheme.  ...  Moreover, a hash function can be incorporated into the scheme in such a way that it is also secure in the random oracle model under the standard RSA assumption. * This is a revision of IBM Research Report  ...  Introduction We describe new, quite efficient digital signature schemes whose security is based on the strong RSA assumption.  ... 
doi:10.1145/319709.319716 dblp:conf/ccs/CramerS99 fatcat:w6zblgm6mbfgtfef6azt4moxta

Cryptography in Subgroups of $\mathbb{Z}_{n}^{*}$ [chapter]

Jens Groth
2005 Lecture Notes in Computer Science  
Using a new decisional assumption, related to high residuosity assumptions, we suggest a homomorphic public-key cryptosystem.  ...  The underlying cryptographic assumption resembles the strong RSA assumption.  ...  [MY04] construct a simulation sound trapdoor commitment scheme based on the Cramer-Shoup signature scheme.  ... 
doi:10.1007/978-3-540-30576-7_4 fatcat:uhfdf4v7cfh4vld7yrhhcoyfsu
« Previous Showing results 1 — 15 out of 5,747 results