Filters








188,794 Hits in 8.6 sec

1-out-of-n Signatures from a Variety of Keys [chapter]

Masayuki Abe, Miyako Ohkubo, Koutarou Suzuki
2002 Lecture Notes in Computer Science  
We present a widely applicable method to construct a 1-out-of-n signature scheme that allows mixture use of different flavors of keys at the same time.  ...  This paper addresses how to use public-keys of several different signature schemes to generate 1-out-of-n signatures. Previously known constructions are for either RSA-keys only or DL-type keys only.  ...  -out-of-n Signatures from a Variety of Keys -out-of-n Signatures from a Variety of Keys -out-of-n Signatures from a Variety of Keys -out-of-n Signatures from a Variety of Keys -out-of-n  ... 
doi:10.1007/3-540-36178-2_26 fatcat:mr2phzb47fef7a6mwz45fcxpx4

Comments on Abe et al.'s Threshold Signer-ambiguous Signature Scheme from Variety of Keys

Yafen Chang, Chin-Chen Chang
2006 Proceedings of the 9th Joint Conference on Information Sciences (JCIS)  
In 2004, Abe et al. proposed a threshold signerambiguous signature scheme from variety of keys.  ...  In this paper, we present a novel threshold signer-ambiguous signature scheme, having the signed message concealed and keeping who the receivers are secret from variety of keys.  ...  In 2004, Abe et al. proposed a t-out-of-n signer-ambiguous signature scheme [2] .  ... 
doi:10.2991/jcis.2006.220 dblp:conf/jcis/ChangC06 fatcat:5abuzwsqerasljb5ncyj7oo7he

A Concealed t-out-of-n Signer Ambiguous Signature Scheme with Variety of Keys

Ya-Fen Chang, Chin-Chen Chang, Pei-Yu Lin
2007 Informatica  
In 2004, Abe et al. proposed a threshold signer-ambiguous signature scheme from variety of keys.  ...  In this paper, we present a novel threshold signer-ambiguous signature scheme, having the signed message concealed and keeping who the receivers are secret from variety of keys.  ...  As a result, we present a novel t-out-of-n signer-ambiguous scheme, which makes the signed message concealed and keeps who the receivers are secret, with variety of keys in this paper.  ... 
doi:10.15388/informatica.2007.192 fatcat:tyoj5xiro5hjhhy6w7plstkixu

Research on a New Signature Scheme on Blockchain

Chao Yuan, Mi-xue Xu, Xue-ming Si
2017 Security and Communication Networks  
Using aggregate signature, the size of the signature could be shortened by compressing multiple signatures into a single signature.  ...  In this paper, a new signature scheme for transactions on blockchain based on the aggregate signature was proposed.  ...  Destination key · · · R 1 = r 1 G (r 1 B 1 , A 1 , x 1 ) R n = r n G (r n B n , A n , x n ) Figure 4 : Aggregate transaction structure.  ... 
doi:10.1155/2017/4746586 fatcat:bllf4a7rjjbf5hssrilgaqfp74

A Multi-signature Scheme with Signers' Intentions Secure against Active Attacks [chapter]

Kei Kawauchi, Hiroshi Minato, Atsuko Miyaji, Mitsuru Tada
2002 Lecture Notes in Computer Science  
Signers' intentions mean a kind of information which can be newly attached to a signature in signers' generating it.  ...  First, we consider a multi-signature scheme realizing the concept of signers' intentions by utilizing existing schemes, and name it primitive method.  ...  Takeshi Okamoto of JAIST for his invaluable advice and useful comments.  ... 
doi:10.1007/3-540-45861-1_25 fatcat:slua74yuvrewbdxfu2hxlug3u4

Concurrent Signatures from a Variety of Keys [article]

George Teseleanu
2021 IACR Cryptology ePrint Archive  
Concurrent signatures allow two entities to produce two ambiguous signatures that become binding once an extra piece of information (called the keystone) is released.  ...  Such a signature is developed by Chen et al., but it restricts signers to using the same public parameters.  ...  Using a variation of Abe et al.'s 1-out-of-n signature with key separation, we introduce a concurrent signature in the separable model.  ... 
dblp:journals/iacr/Teseleanu21a fatcat:uf2yrxhwwnc37fyr56bq4v2o5e

Signer and Message Ambiguity from a Variety of Keys [article]

George Teseleanu
2021 IACR Cryptology ePrint Archive  
The first one assumes that the signer hides his identity in n independently generated public keys, while the second one assumes that all n public keys share the same public parameters.  ...  In this work, we formalize this type of signature, introduce the corresponding security requirements and describe two instantions.  ...  In this case, we can see that a mixture of an 1-out-of-n 1 signature and an n 2 message oblivious signature can offer a possible solution.  ... 
dblp:journals/iacr/Teseleanu21 fatcat:uay5eqejxzat3hpnu2mh74pody

A k-out-of-n Ring Signature with Flexible Participation for Signers [article]

Takeshi Okamoto, Raylin Tso, Michitomo Yamaguchi, Eiji Okamoto
2018 IACR Cryptology ePrint Archive  
Our signature scheme has a multiple ring structure, each ring of which is based on 1-out-of-n ring signature.  ...  Our signature has a remarkable property: When the signature is updated from k-out-of-n to (k + α)-out-of-n, the previous signers do not need to sign a message again.  ...  This time they want to update the signature from k-out-of-n to (k+α)-out-of-n ring signatures.  ... 
dblp:journals/iacr/OkamotoTYO18 fatcat:n2j54pngfrfznnxulfuv6nsvqm

Sub-Shimura Varieties for type O(2,n)

Andrew Fiori
2018 Journal de Théorie des Nombres de Bordeaux  
We give a classification, up to consideration of component groups, of sub-Shimura varieties of those Shimura Varieties attached to orthogonal groups of signature (2,n) over Q.  ...  The only non-trivial maps from a group SU(1, q) to a group SO(2, n) for q ≥ 2 come from the standard representation of SU(1, q).  ...  Shimura varieties attached to orthogonal groups of signature (2, n).  ... 
doi:10.5802/jtnb.1060 fatcat:4dadbpfc7vgltl4dzf7tbunolu

A New Digital Signature Algorithm Similar to ELGamal Type

Haipeng Chen, Xuanjing Shen, Yingda Lv
2010 Journal of Software  
key system, a new kind of digital signature algorithm, which is similar to ELGamal, named H-S DSA (Hash Round Function and Self-certified Public Key System Digital Signature Algorithm) is raised and realized  ...  Finally, the authors analyze the H-S DSA from two aspects of security and time-complexity.  ...  With the more extensive application of digital signatures, new issues will emerge from a variety of digital signature algorithms, but people will try hard correspondingly to make new solutions.  ... 
doi:10.4304/jsw.5.3.320-327 fatcat:3zbyw2zhwbdbrgtlnqf7wby3f4

Some Aspects of Post-Quantum Cryptosystems

Avtandil Gagnidze, Maksim Iavich, Giorgi Iashvili
2017 Eurasian Journal of Business and Management  
There are described Hash-based Digital Signature Schemes and McEliece system, based on the theory of algebraic coding.  ...  We analyzed their advantages and disadvantages, and considered some of the attacks on these systems. It is shown that today we are not prepared to transfer cryptosystems to post-quantum era.  ...  Based on the theory of algebraic coding we developed Hash-based Digital Signature Schemes and McEliece system.  ... 
doi:10.15604/ejbm.2017.05.01.002 fatcat:gweqmjiodjamnncpyobk4ogbtq

Analysis of an Electronic Voting Protocol in the Applied Pi Calculus [chapter]

Steve Kremer, Mark Ryan
2005 Lecture Notes in Computer Science  
The applied pi calculus has a family of proof techniques which we can use, is supported by the ProVerif tool [4], and has been used to analyse a variety of security protocols [1, 11] .  ...  In this paper, we study a protocol commonly known as the FOO 92 scheme [12] , which works with blind signatures.  ...  2 (* open digital signature *) fun pk / 1 (* get public key from private key *) fun host / 1 (* get host from public key *) fun getpk / 1 (* get public key from host *) fun b l i n d / 2 (* blinding *  ... 
doi:10.1007/978-3-540-31987-0_14 fatcat:hndkcjjwzzbmrc3hxoqmpsjjfy

Enhancing privacy and trust in electronic communities

Bernardo A. Huberman, Matt Franklin, Tad Hogg
1999 Proceedings of the 1st ACM conference on Electronic commerce - EC '99  
A major impediment to using recommendation systems and collective knowledge for electronic commerce is the reluctance of individuals to reveal preferences in order to nd groups of people that share them  ...  We adapt known techniques from the cryptographic literature to enable these new capabilities.  ...  The signature version of the 1-out-of-n proof of knowledge is useful for distributing community-wide conference keys as discussed in Section 3.  ... 
doi:10.1145/336992.337012 dblp:conf/sigecom/HubermanFH99 fatcat:lyftus4gh5edtpnkrzfl35lara

Protection of mobile agent and its itinerary from malicious host

Shashank Srivastava, G. C Nandi
2011 2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)  
With Mobile Agent is becoming common in a variety of applications on Electronic Commerce, how to protect the transaction security is the key technology of based Agent Electronic Commerce System.  ...  As a promising distributed computing technology, Mobile Agent (MA) can be used in many fields. But the security problem of MA is a barrier for application of MA technology.  ...  key of host (0= i = n).  ... 
doi:10.1109/iccct.2011.6075189 fatcat:gtgmm6krrreynibh55ndtyexmi

DDH-based Multisignatures with Public Key Aggregation [article]

Duc-Phong Le, Guomin Yang, Ali Ghorbani
2019 IACR Cryptology ePrint Archive  
A multisignature scheme allows a group of signers to produce a joint signature on a common message, which is more compact than a collection of distinct signatures from all signers.  ...  Such multisignatures provide not only a compact signature, but also a compact aggregated public key, that is both the signature size and the public key size used to verify the correctness of the signature  ...  . , s n from F, A computes s = n i=1 s i mod q and returns the valid signature (c, s).  ... 
dblp:journals/iacr/LeYG19 fatcat:edtwxygctnddfie54a6hjy6w3i
« Previous Showing results 1 — 15 out of 188,794 results