A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Filters
Signature schemes based on the strong RSA assumption
1999
Proceedings of the 6th ACM conference on Computer and communications security - CCS '99
Preserved Fulltext
so-called strong RSA assumption. ...
We describe and analyze a new digital signature scheme. ...
Acknowledgments Thanks to Dan Boneh for pointing out the random self reducibility property discussed in §4. ...
doi:10.1145/319709.319716
dblp:conf/ccs/CramerS99
fatcat:w6zblgm6mbfgtfef6azt4moxta
Signature schemes based on the strong RSA assumption
2000
ACM Transactions on Privacy and Security
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
so-called strong RSA assumption. ...
We describe and analyze a new digital signature scheme. ...
Acknowledgments Thanks to Dan Boneh for pointing out the random self reducibility property discussed in §4. ...
doi:10.1145/357830.357847
fatcat:sv4pixeombd65hziuculedzbai
A Forward-Secure Blind Signature Scheme Based on the Strong RSA Assumption
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Using forking lemma proposed by Pointcheval and Stern [4], we can show the equivalence between existence of a forger with feasibility of solving the strong RSA problem. ...
Our scheme is constructed from the provably secure Okamoto-Guillou-Quisquater (OGQ for short) blind signature scheme. ...
Acknowledgment The first author is grateful to Dr. Zhang Fangguo for his helpful discussion on blind signature. The second author is partially supported by SNU foundation in 2003. ...
doi:10.1007/978-3-540-39927-8_2
fatcat:6kg7qp3ypzey3hxyw5cuzkxiau
An efficient forward-secure proxy-protected signature scheme based on the strong RSA assumption
2010
2010 3rd International Conference on Computer Science and Information Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Then, a generic forward-secure proxy-protected signature scheme is proposed based on the strong RSA assumption. ...
A proxy signature scheme is an important extension of the digital signature scheme, nowadays, is an active research topic, which attracts more researchers' attentions. ...
ACKNOWLEDGMENT The authors would like to express their cordial thanks to Universiti Sains Malaysia (USM) for supporting this research by the FRGS-USM grant. ...
doi:10.1109/iccsit.2010.5564931
fatcat:kfvqhb4zyrbl7eumxrulllmcjm
Short Signatures from Weaker Assumptions
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
For example, our q-Diffie-Hellman signatures can be as short as 200 bits; the signing algorithm of our Strong RSA signature scheme can be as efficient as the one in RSA full domain hash; compared to previous ...
., be plugged into the generic constructions by Hofheinz and Kiltz (J. 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
New Online/Offline Signature Schemes Without Random Oracles
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In contrast to Cramer-Shoup's signature scheme based on strong RSA in the standard model, no costly generation of prime numbers is required for the signer in our proposed schemes. ...
In this paper, we propose new signature schemes provably secure under the strong RSA assumption in the standard model. ...
Acknowledgments The authors wish to thank anonymous referees for useful comments. The second author was supported by the Japanese Society for Promotion of Science (JSPS) for doing research in Japan. ...
doi:10.1007/11745853_22
fatcat:cwagbppkhzcs5h5sxpetaofxa4
A Practical and Tightly Secure Signature Scheme Without Hash Function
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In 1999, two signature schemes based on the flexible RSA problem (a.k.a. strong RSA problem) were independently introduced: the Gennaro-Halevi-Rabin (GHR) signature scheme and the Cramer-Shoup (CS) signature ...
As a result, we obtain a practical signature scheme (and an on-line/off-line variant thereof) whose security is solely and tightly related to the strong RSA assumption. ...
Signature Schemes Based on the Strong-RSA Assumption We briefly review several efficient signature schemes the security of which relies on the strong RSA assumption, in the standard model. ...
doi:10.1007/11967668_22
fatcat:t4ewfbm3y5awbplfcajkytyp6m
A Multi-trapdoor Commitment Scheme from the RSA Assumption
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
based on the standard RSA assumption
References
Interaction Reusability Assumptions
[DIO98]
NI
No
one-way function
[FF00, FF09] I
No
DL, RSA, or Factoring
[DKOS01]
NI
No
DL or RSA
[DG03 ...
based on the standard RSA assumption
References
Interaction Reusability Assumptions
[DIO98]
NI
No
one-way function
[FF00, FF09] I
No
DL, RSA, or Factoring
[DKOS01]
NI
No
DL or RSA
[DG03 ...
doi:10.1007/978-3-642-14081-5_12
fatcat:cehmthn4nbh7pb4ygjjbnoywra
A Forward-secure Threshold Signature Scheme Based on Multiplicative Secret Sharing and Strong RSA Assumption
2017
DEStech Transactions on Computer Science and Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
A new forward-secure threshold digital signature scheme which based on multiplicative secret sharing and strong RSA assumption is put forward in this paper. ...
At the start of each time period, an update protocol is executed among any subset of u k non-corrupted players. The protocol modifies the secret key for the signature scheme. ...
Such as Cai-Fen Wang [11] proposed a forward security secret sharing scheme, based on hard problems of the discrete logarithm in finite field and the strong RSA assumption, it effectively realized the ...
doi:10.12783/dtcse/cimns2017/16319
fatcat:xqnmfvm4ojgkpbsfpjgors23we
A Forward-secure Threshold Signature Scheme Based on Multiplicative Secret Sharing and Strong RSA Assumption
2018
DEStech Transactions on Computer Science and Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
A new forward-secure threshold digital signature scheme which based on multiplicative secret sharing and strong RSA assumption is put forward in this paper. ...
At the start of each time period, an update protocol is executed among any subset of u k non-corrupted players. The protocol modifies the secret key for the signature scheme. ...
Such as Cai-Fen Wang [11] proposed a forward security secret sharing scheme, based on hard problems of the discrete logarithm in finite field and the strong RSA assumption, it effectively realized the ...
doi:10.12783/dtcse/cimns2017/17439
fatcat:uk7s5qdxrvd5dehjyxflfsy4gm
Realizing Hash-and-Sign Signatures under Standard Assumptions
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Moreover, most current instances rely on strong and less studied assumptions such as the Strong RSA and q-Strong Diffie-Hellman assumptions. ...
We achieve two new realizations for hashand-sign signatures respectively based on the RSA assumption and the Computational Diffie-Hellman assumption in bilinear groups. ...
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
Cryptography in Subgroups of $\mathbb{Z}_{n}^{*}$
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The underlying cryptographic assumption resembles the strong RSA assumption. ...
Cryptographic schemes for integer commitment and digital signatures have been suggested over large subgroups of Z * n , by reducing the order of the groups we obtain quite similar but more efficient schemes ...
Signature Cramer and Shoup [CS00] suggest an efficient signature scheme based on the strong RSA assumption where security can be proved in the standard model without using random oracles. ...
doi:10.1007/978-3-540-30576-7_4
fatcat:uhfdf4v7cfh4vld7yrhhcoyfsu
Short and Stateless Signatures from the RSA Assumption
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Prior short, standard model signatures in the RSA setting required either a strong complexity assumption such as Strong RSA or (recently) that the signer maintain state. ...
We present the first signature scheme which is "short", stateless and secure under the RSA assumption in the standard model. ...
Acknowledgments We thank Amit Sahai for helpful discussions and the anonymous reviewers for their helpful comments. ...
doi:10.1007/978-3-642-03356-8_38
fatcat:qjrggrkn4ncgdabiust267pf4m
Secure Hash-and-Sign Signatures Without the Random Oracle
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This scheme is not based on "signature trees", and instead it uses the so called "hash-and-sign" paradigm. ...
We present a new signature scheme which is existentially unforgeable under chosen message attacks, assuming some variant of the RSA conjecture. ...
These is no need to maintain trees and to rely on some stored information on the history of previous signatures. The security of the scheme is based on two main assumptions. ...
doi:10.1007/3-540-48910-x_9
fatcat:xruhzmlmbrb2pb4hibrmr655ge
Property-Based Anonymous Attestation in Trusted Cloud Computing
2014
Journal of Electrical and Computer Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The platform configuration information is converted by the matrix algorithm into the property certificate, and the remote attestation is implemented by trusted ring signature scheme based on Strong RSA ...
By scenario comparison, we obtain the trusted ring signature scheme based on RSA, which has advantages with the growth of the ring numbers. ...
The security analysis is based on the Strong RSA Assumption. Strong RSA Assumption is a given RSA modulus, and a given random number < . It is difficult to find , ( > 1, < ), satisfying = . ...
doi:10.1155/2014/687158
fatcat:rqu4tjtqpvanhlgmo4gonwqqny
« Previous
Showing results 1 — 15 out of 4,955 results