338 Hits in 2.5 sec

Page 5416 of Mathematical Reviews Vol. , Issue 98H [page]

1998 Mathematical Reviews  
Summary: “Multiparty cryptography is an important topic in con- temporary cryptography. In this paper we examine the security of some multiparty signature schemes.  ...  We consider the problem of determining for a given distribution Pyyz whether Alice and Bob can in principle, by communicating over an insecure channel accessible to Eve, generate a secret key about which  ... 

Deniable Encryption Key

P.Lokesh Kumar Reddy P.Lokesh Kumar Reddy
2013 IOSR Journal of Computer Engineering  
An appealing property in the mediated RSA, PKI was introduced that, the user has no information, neither about his full private (decryption) key, nor the factorization of the RSA public modulus, which  ...  Deniable encryption is an important that allows a user (a sender and/or a receiver) to escape a coercion attempted by a coercive adversary.  ...  Our scheme is based on mediated RSA PKI. Our scheme proves efficiency over that proposed in [5] in the sense of bandwidth, deniability and decipherability.  ... 
doi:10.9790/0661-1140812 fatcat:7m2yh7yoe5aipnq22qwyofi62q

Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting [chapter]

Carmit Hazay, Gert Læssøe Mikkelsen, Tal Rabin, Tomas Toft
2012 Lecture Notes in Computer Science  
Our RSA key generation is comprised of the following: (i) a distributed protocol for generation of an RSA composite, and (ii) a biprimality test for verifying the validity of the generated composite.  ...  The problem of generating an RSA composite in a distributed manner without leaking its factorization is particularly challenging and useful in many cryptographic protocols.  ...  The receiver, R, generates a Paillier key, N , i.e. an RSA modulus.  ... 
doi:10.1007/978-3-642-27954-6_20 fatcat:rix5eejri5a2hceitvucqsudza

New efficient and secure protocols for verifiable signature sharing and other applications [chapter]

Dario Catalano, Rosario Gennaro
1998 Lecture Notes in Computer Science  
The original RSA and Rabin V~5 protocols were subsequently broken and the original DSS V~S lacks a formal proof of security. We present new protocols for RSA, Rabin and DSS VES .  ...  Some of the by-products of our main result are: a new threshold cryptosystem, a new undeniable signature scheme and a way to create binding RSA cryptosystems. * Extended abstract.  ...  Acknowledgments: We would like to thank Tal Rabin for several discussions over the topic of proactive RSA.  ... 
doi:10.1007/bfb0055723 fatcat:utofqmutzvdhbeij4whod7j5zu

New Efficient and Secure Protocols for Verifiable Signature Sharing and Other Applications

Dario Catalano, Rosario Gennaro
2000 Journal of computer and system sciences (Print)  
The original RSA and Rabin V~5 protocols were subsequently broken and the original DSS V~S lacks a formal proof of security. We present new protocols for RSA, Rabin and DSS VES .  ...  Some of the by-products of our main result are: a new threshold cryptosystem, a new undeniable signature scheme and a way to create binding RSA cryptosystems. * Extended abstract.  ...  Acknowledgments: We would like to thank Tal Rabin for several discussions over the topic of proactive RSA.  ... 
doi:10.1006/jcss.1999.1685 fatcat:qgzylh23nrdpjns6w7vaohiv6a

Optimizing Robustness While Generating Shared Secret Safe Primes [chapter]

Emil Ong, John Kubiatowicz
2005 Lecture Notes in Computer Science  
We develop a method for generating shared, secret, safe primes applicable to use in threshold RSA signature schemes such as the one developed by Shoup.  ...  Specifically, we show optimizations that minimize the number and size of the proofs of knowledge used.  ...  At this point, the players have all generated a public RSA modulus for which no player knows the factors. Moreover, the players can compute secret shares of the Euler totient function of the modulus.  ... 
doi:10.1007/978-3-540-30580-4_9 fatcat:yorc67ufrvf2fl7lejw3vf3cui

Efficient and General PVSS Based on ElGamal Encryption

Kun Peng
2012 Journal of Information Processing Systems  
Most of the existing PVSS schemes do not employ an ElGamal encryption to encrypt the shares. Instead, they usually employ other encryption algorithms like a RSA encryption and Paillier encryption.  ...  Moreover, it is a general PVSS technique without any special limitation. Finally, an encryption-improving technique is proposed to achieve very high efficiency in the new PVSS scheme.  ...  So the threat of an attack exploiting small RSA public keys is serious in PVSS and the public keys of the RSA cipher in PVSS should be more cautiously chosen.  ... 
doi:10.3745/jips.2012.8.2.375 fatcat:nolgrdpqgvcjbkksp62xqnbkxu

Generation of Shared RSA Keys by Two Parties [chapter]

Guillaume Poupard, Jacques Stern
1998 Lecture Notes in Computer Science  
At Crypto'97 Boneh and Franklin proposed a protocol to efficiently generate shared RSA keys. In the case of two parties, the drawback of their scheme is the need of an independent third party.  ...  In this paper, we propose a protocol that enables two parties to evaluate any algebraic expression, including an RSA modulus, along the same lines as in the Boneh-Franklin protocol.  ...  about n 2 /4 times in order to obtain an RSA modulus N .  ... 
doi:10.1007/3-540-49649-1_2 fatcat:b3bwkirkfbd4vjqjmc2isrpdka

Digital Signatures for e-Government - A Long-Term Security Architecture [chapter]

Przemysław Błaśkiewicz, Przemysław Kubiak, Mirosław Kutyłowski
2011 Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering  
In this paper we propose further mechanisms that can be applied on top of mediated RSA, so that we obtain signatures compatible with the standard format, but providing security guarantees even in the case  ...  when RSA becomes broken or the keys are compromised.  ...  We propose that the modulus N and the secret exponent d of RSA should be generated outside the card in a multiparty protocol (accordingly, we divide the security mediator SEM into t sub-SEMs, t ≥ 2).  ... 
doi:10.1007/978-3-642-23602-0_24 fatcat:wvmlbg32grcnxidnysv6zzb5tq

Ad hoc key management infrastructure

B. Lehane, L. Dolye, D. O'Mahony
2005 International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II  
Key Management Infrastructure in an ad hoc network needs to be formed in an ad hoc manner.  ...  Figure 3 shows the timing results of 200 runs of the shared RSA key generation protocol for both a 1024bit RSA modulus and a 512bit RSA modulus.  ...  During group formation a group of nodes (a subset or the entire group) engage in a shared RSA key generation procedure. They generate a threshold sharing of an RSA key pair.  ... 
doi:10.1109/itcc.2005.57 dblp:conf/itcc/LehaneDO05 fatcat:c5kefjynazf5djwaih5upheoda

Computing Inverses over a Shared Secret Modulus [chapter]

Dario Catalano, Rosario Gennaro, Shai Halevi
2000 Lecture Notes in Computer Science  
The most interesting case is when φ is the Euler function of a known RSA modulus N , φ = φ(N ).  ...  We discuss the following problem: Given an integer φ shared secretly among n players and a prime number e, how can the players efficiently compute a sharing of e −1 mod φ.  ...  The public key of the signer is an RSA modulus N , product of two safe primes p, q, and a random element s ∈ Z * N .  ... 
doi:10.1007/3-540-45539-6_14 fatcat:4eycdfpquzcsbm7bulbur6ikgy

MPC-enabled Privacy-Preserving Neural Network Training against Malicious Attack [article]

Ziyao Liu, Ivan Tjuawinata, Chaoping Xing, Kwok-Yan Lam
2021 arXiv   pre-print
Such conversion scheme is essential in securely and correctly converting shared Beaver triples defined over an integer ring generated in the preprocessing phase to triples defined over a field to be used  ...  The application of secure multiparty computation (MPC) in machine learning, especially privacy-preserving neural network training, has attracted tremendous attention from the research community in recent  ...  Distributed Paillier key generation includes two subprotocols, i.e., (i) distributed RSA modulus generation, and (ii) distributed biprimality test to verify the validity of generated RSA modulus in (i)  ... 
arXiv:2007.12557v3 fatcat:eg2br7kbb5a5xp46e6z43mmh5u

Fully Distributed Threshold RSA under Standard Assumptions [chapter]

Pierre-Alain Fouque, Jacques Stern
2001 Lecture Notes in Computer Science  
This comes from the fact that the scheme needs a special assumption on the RSA modulus and this kind of RSA moduli cannot be easily generated in an efficient way with many players.  ...  The only practical result to generate RSA moduli in a distributive manner is Boneh and Franklin's protocol but it seems difficult to modify it in order to generate the kind of RSA moduli that Shoup's protocol  ...  On the other hand, Boneh and Franklin at Crypto '97 [4] describe a protocol to share the key generation of an RSA modulus.  ... 
doi:10.1007/3-540-45682-1_19 fatcat:vifsdwy5mvgmfd6eqpkqyriqri

Efficient Threshold RSA Signatures with General Moduli and No Extra Assumptions [chapter]

Ivan Damgård, Kasper Dupont
2005 Lecture Notes in Computer Science  
We do not need special conditions on the RSA modulus, extra complexity or set-up assumptions or random oracles. An "optimistic" variant of the scheme is even more efficient in case no faults occur.  ...  We propose techniques that allow construction of robust threshold RSA signature schemes that can work without a trusted dealer using known key generation protocols and is as efficient as the best previous  ...  We obtain that is this case, the expected number of subsets to test is in O(1) if the soundness error of the correctness proofs is at most 1/ct 2 where c > 3.  ... 
doi:10.1007/978-3-540-30580-4_24 fatcat:axusykaytfh4zfiifq2cn62bci

Page 5145 of Mathematical Reviews Vol. , Issue 99g [page]

1999 Mathematical Reviews  
5145 mainly discusses those algorithms used to generate public keys, such as those used to generate primes and elements of high order.  ...  The security of the new system is equivalent to factoring the public modulus. Like other systems of this kind, the new system is impractical because of its mathematical intricacy. Thomas W.  ... 
« Previous Showing results 1 — 15 out of 338 results