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
Round Optimal Distributed Key Generation of Threshold Cryptosystem Based on Discrete Logarithm Problem
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
Distributed key generation is one of the most challenging tasks for threshold cryptosystems. ...
In this paper,we propose a one round distributed key generation protocol for discrete logarithm problem (DLP) based threshold cryptosystems. ...
Thus secret key shares of discrete logarithm has been generated for a (t, n) threshold cryptosystem. ...
doi:10.1007/978-3-540-45203-4_8
fatcat:45er6ymncfhizo4ym7u2qwtebe
Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer
2021
Rad Hrvatske akademije znanosti i umjetnosti Matematičke znanosti
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 2022; you can also visit the original URL.
The file type is application/pdf.
The new cryptosystem is fully distributed, i. e., public and private key generation is performed without a trusted dealer. ...
We propose the first hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer and prove its security in the malicious adversary model. ...
The private key can be generated analogously to the threshold RSA cryptosystem in [6] . ...
doi:10.21857/mnlqgc582y
fatcat:kkpdrjo74fav5k5n2tiqgwcaaa
An Computation-Efficient Generalized Group-Oriented Cryptosystem
2010
Informatica
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.
Further, conversion of the scheme into a threshold cryptosystem results in inefficiency. This study enhances Li et al.' ...
s GOC, both in that it achieves the requirements of GOC but also that it can be efficiently converted into a threshold cryptosystem. ...
In this study, a computation-efficient Generalized Group-Oriented Cryptosystem (GGOC) based on Pedersen's threshold cryptosystem (Pedersen, 1991a) is presented which is more general than Li et al.' ...
doi:10.15388/informatica.2010.290
fatcat:qucfb46kbja2hhth5czwbkz3oq
Security Analysis of Key Binding Biometric Cryptosystems
[chapter]
2012
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.
The proposed measures take into account the specific effect of key binding cryptosystems. ...
In biometric cryptosystems the realized works are hampered by the lack of formal security analysis. ...
In next section we propose a set of generalized criteria to evaluate the overall security of biometric cryptosystems. ...
doi:10.1007/978-3-642-31254-0_31
fatcat:2u6dedqxxnbb7ldy4wjgh5pkcm
Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks
[chapter]
2001
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 this article we rehabilitate the twin-encryption paradigm proposed by Naor and Yung to present generic conversions from a large family of (threshold) IND-CPA scheme into a (threshold) IND-CCA one in ...
This new construction provides the first example of threshold cryptosystem secure against chosen-ciphertext attacks based on the factorization problem. ...
Threshold Cryptosystems A t out of threshold cryptosystem consists of the following components: -A key generation algorithm K that takes as input a security parameter in unary notation 1 k , the number ...
doi:10.1007/3-540-45682-1_21
fatcat:xzigglz2obde7p6tvfjrmkykje
Threshold cryptosystem with multiple secret sharing policies
1994
IEE Proceedings - Computers and digital Techniques
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 2010; you can also visit the original URL.
The file type is application/pdf.
All earlier solutions assume that there is only one secret sharing policy (i.e. one threshold value). We propose the first threshold cryptosystem with multiple secret sharing policies. ...
In a group-oriented threshold cryptosystem, each group, instead of each individual member within the group, publishes a single group public key. ...
In a straightforward approach we can implement the threshold cryptosystem with multiple secret sharing policies by using any existing threshold cryptosystem repeatedly for each threshold value and distributing ...
doi:10.1049/ip-cdt:19941003
fatcat:qdes65hwyjgsppwp3alwakpsfi
How to Construct Multicast Cryptosystems Provably Secure Against Adaptive Chosen Ciphertext Attack
[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 2006; you can also visit the original URL.
The file type is application/pdf.
of this general approach. ...
In this paper we present a general framework for constructing efficient multicast cryptosystems with provable security and show that a line of previous work on multicast encryption are all special cases ...
Threshold cryptosystems are part of a general approach known as threshold cryptography, introduced by Boyd [28] , Desmedt [29] , and Desmedt and Frankel [30] . ...
doi:10.1007/11605805_16
fatcat:4azki6re6zh7pce23tfcvogv3m
Securing Threshold Cryptosystems against Chosen Ciphertext Attack
2002
Journal of Cryptology
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 2007; you can also visit the original URL.
The file type is application/pdf.
For the most compelling applications of threshold cryptosystems, security against chosen ciphertext attack is a requirement. ...
The contribution of this paper is to present two very practical threshold cryptosystems, and to prove that they are secure against chosen ciphertext attack in the random oracle model. ...
Difficulties in securing threshold cryptosystems against chosen ciphertext attack Threshold cryptosystems are part of a general approach known as threshold cryptography, introduced by Boyd [Boy86] , Desmedt ...
doi:10.1007/s00145-001-0020-9
fatcat:omddi4i2ujbh7b5ylcuxhryqs4
Securing threshold cryptosystems against chosen ciphertext attack
[chapter]
1998
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 2007; you can also visit the original URL.
The file type is application/pdf.
For the most compelling applications of threshold cryptosystems, security against chosen ciphertext attack is a requirement. ...
The contribution of this paper is to present two very practical threshold cryptosystems, and to prove that they are secure against chosen ciphertext attack in the random oracle model. ...
Difficulties in securing threshold cryptosystems against chosen ciphertext attack Threshold cryptosystems are part of a general approach known as threshold cryptography, introduced by Boyd [Boy86] , Desmedt ...
doi:10.1007/bfb0054113
fatcat:gtd6cxk5rfdn5htqil4yjfxp6m
Sharing Decryption in the Context of Voting or Lotteries
[chapter]
2001
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 2013; you can also visit the original URL.
The file type is application/pdf.
Several public key cryptosystems with additional homomorphic properties have been proposed so far. ...
In this paper, we propose a distributed version of the Paillier cryptosystem presented at Eurocrypt '99. ...
Our a im is t o p r o vide robust threshold version of s emantically secure cryptosystems. ...
doi:10.1007/3-540-45472-1_7
fatcat:o364zdkyjjc3tiupjmi25ogmwm
SCCR: a generic approach to simultaneously achieve CCA security and collusion-resistance in proxy re-encryption
2009
Security and Communication Networks
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 2014; you can also visit the original URL.
The file type is application/pdf.
We address these challenges by using CCA-secure (2, 2) threshold cryptosystem to obtain public verifiability, and the method of key management in identity-based encryption (IBE) to achieve collusion-resistance ...
A unique characteristic of SCCR is that it is a generic construction which has more advantages than a concrete PRE scheme does. ...
Example: based on SG1 threshold cryptosystem In this subsection, we give an example of our generic construction, named SG-UniPRE, which is based on SG1 threshold cryptosystem [32] . ...
doi:10.1002/sec.109
fatcat:u23x3lhy6rbt3hxa45slvzw7lm
TTP SmartCard-Based ElGamal Cryptosystem Using Threshold Scheme for Electronic Elections
[chapter]
2012
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.
To enforce the privacy and security of the private key, secret sharing schemes (or threshold schemes) are used to generate a distributed key into several entities. ...
We study in this work the feasibility of developing ElGamal cryptosystem and Shamir's secret sharing scheme into JavaCards, whose API gives no support for it. ...
This polynomial will be used to generate the shares of the (t, n)-threshold scheme. ...
doi:10.1007/978-3-642-27901-0_2
fatcat:hk4meyubyff7npywnrdcz56fna
General Group Oriented ID-based Cryptosystems with Chosen Plaintext Security
2008
International Journal of Network 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 2020; you can also visit the original URL.
The file type is application/pdf.
A scheme for general group oriented ID-based cryptosystems is proposed. This scheme allows an authorized subset in the general access structure to cooperatively decrypt the ciphertext of a message. ...
Thus general group oriented cryptosystems have wider application potential than threshold schemes in the real world. ...
Liber and Quisquater [9] did a generation of Boneh-Franklin's ID-based scheme and proposed an ID-based threshold cryptosystem. ...
dblp:journals/ijnsec/XuZX08
fatcat:pgypdthi6jfavjnixlhmkj6t6e
Page 4868 of Mathematical Reviews Vol. , Issue 2003f
[page]
2003
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “For the most compelling applications of threshold cryptosystems, security against chosen cipher text attack is a re- quirement. ...
Summary: “Threshold group signature is a generalization of group signature, in which only an authorized subset can represent a group to generate a signature and the identities of signers of a signature ...
A Security Upgrade on the GGH Lattice-based Cryptosystem
2020
Sains Malaysiana
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 GGH cryptosystem was initially addressed as the first practical latticebased cryptosystem. ...
Once the cryptosystem is implemented in a lattice dimension of 300 and above, its inventors was conjectured that the cryptosystem is intractable. ...
Since the threshold parameter is a public information, the Nguyen's attack generates an integer vector . thus, the following equations hold, Since and , then . thus, By equation , as well. this implies ...
doi:10.17576/jsm-2020-4906-25
fatcat:l3ivkjtd2zgkzdd4urrzku6dni
« Previous
Showing results 1 — 15 out of 7,222 results