18,586 Hits in 9.4 sec

Total Break of the ℓ-IC Signature Scheme [chapter]

Pierre-Alain Fouque, Gilles Macario-Rat, Ludovic Perret, Jacques Stern
Public Key Cryptography – PKC 2008  
In this paper, we describe efficient forgery and full-key recovery attacks on the -ICsignature scheme recently proposed at PKC 2007.  ...  in a finite field of medium size and the public key is shorter than in many multivariate signature schemes.  ...  Acknowledgements The work described in this paper has been supported by the ANR MAC project and by the European Commission through the IST Program under contract IST-2002-507932 ECRYPT.  ... 
doi:10.1007/978-3-540-78440-1_1 dblp:conf/pkc/FouqueMPS08 fatcat:4h2u6h62unfjhhvu7h7ycsp7yu

Remarks on the Attack of Fouque et al. against the ℓIC Scheme [chapter]

Naoki Ogura, Shigenori Uchiyama
2008 Lecture Notes in Computer Science  
In this paper, we propose an another practical attack against the IC encryption/signature scheme.  ...  This is one of the most efficient trapdoors for encryption/signature schemes, and of the mixed field type for multivariate quadratic publickey cryptosystems.  ...  Summary of Attack against IC- In this section, we will show a brief sketch of our attack against IC-schemes. The Table 2 shows an algorithm of breaking signature schemes based on odd-ICscheme.  ... 
doi:10.1007/978-3-540-89598-5_3 fatcat:hrx7mevstjhlxinjl35ewkafve

Tightly Secure Non-Interactive Multisignatures in the Plain Public Key Model

Haifeng Qian, Xiangxue Li, Xinli Huang
2012 Informatica  
Multisignature scheme allows a group of signers to generate a compact signature on a common document that certifies they endorsed the message.  ...  However, the existing state of the art multisignatures often suffers from the following problems: impractical key setup assumptions, loose security reductions and inefficient signature verification.  ...  Besides, This work has been supported by the National Natural Science Foundation of China, Grant numbers 61172085, 11061130539, 61103221, 61271118, 61272536 and 61021004.  ... 
doi:10.15388/informatica.2012.369 fatcat:txnx7piqizbjxmdxklxzjwas6i

A Forward-Secure Digital Signature Scheme [chapter]

Mihir Bellare, Sara K. Miner
1999 Lecture Notes in Computer Science  
We describe a digital signature scheme in which the public key is xed but the secret signing key is updated at regular intervals so as to provide a forward s e curity property: compromise of the current  ...  Our construction uses ideas from the Fiat-Shamir and Ong-Schnorr identi cation and signature schemes, and is proven to be forward secure based on the hardness of factoring, in the random oracle model.  ...  Acknowledgments We thank the Crypto 98 program committee and Michel Abdalla for their comments. We thank Victor Shoup for helpful discussions.  ... 
doi:10.1007/3-540-48405-1_28 fatcat:7wvym7fymza4xlolateg2jfi4y

IC card-based single sign-on system that remains secure under card analysis

Jun Furukawa, Kazue Sako, Satoshi Obana
2009 Proceedings of the 5th ACM workshop on Digital identity management - DIM '09  
However, most of these systems are vulnerable when IC cards are analyzed since the security is solely dependent on the secret information born in side the card.  ...  In this paper, we propose a novel single sign-on system with IC card that still keeps certain level of security even when user's IC card is analyzed.  ...  When the IC card responds to Sign-L and Sign-M, it needs random number source if the used signature scheme is probabilistic.  ... 
doi:10.1145/1655028.1655043 dblp:conf/dim/FurukawaSO09 fatcat:eqaiejk2gzb75jaacajdvf5wtq

On the Security Properties of e-Voting Bulletin Boards [chapter]

Aggelos Kiayias, Annabell Kuldmaa, Helger Lipmaa, Janno Siim, Thomas Zacharias
2018 Lecture Notes in Computer Science  
In addition, we show that special care should be taken for the choice of the underlying cryptographic primitives, so that the claimed fault tolerance threshold of N/3 out-of N corrupted peers is preserved  ...  [ICDCS 2016], the importance of removing BB as a single point of failure has been extensively discussed.  ...  A Security definitions of signature schemes and threshold signature schemes A.1 EUFCMA security of signature schemes Le DS = (KGen, Sig, Vf) be a signature scheme.  ... 
doi:10.1007/978-3-319-98113-0_27 fatcat:zuvtzkiinrachg7bxwq6bq4e4e

A signature with shared verification scheme [chapter]

Marijke De Soete, Jean-Jacques Quisquater, Klaus Vedder
1990 Lecture Notes in Computer Science  
This paper presents a signature scheme for a single user or a group of users. The shared verification of such a signature uses the principle of threshold schemes.  ...  The constructions are based on a special class of finite incidence structures, so called generalised quadrangles.  ...  Next one can ask for the probability to break the whole system by determining the ovoid 6 . Suppose an opponent knows two points z1 and z 2 of a valid signature.  ... 
doi:10.1007/0-387-34805-0_23 fatcat:7ajvvkhfd5hhzn7mjyhhejbm4e

Differential Geometry of Ice Flow

Felix S. L. Ng, G. Hilmar Gudmundsson, Edward C. King
2018 Frontiers in Earth Science  
ACKNOWLEDGMENTS FN acknowledges the support of a Leverhulme Trust Research Fellowship in 2017-18 (no. RF-2017-320), which funded this study.  ...  We thank two reviewers and the editor for their helpful comments on our manuscript.  ...  Figures 4B-D detail a real example of such signature compiled from data from the onset area of a tributary of Bindschadler Ice Stream.  ... 
doi:10.3389/feart.2018.00161 fatcat:t2orvspserfgdcidftzdvjlp7m

Generating EIGamal Signatures Without Knowing the Secret Key [chapter]

Daniel Bleichenbacher
1996 Lecture Notes in Computer Science  
We present a new method to forge EIGamal signatures if the public parameters of the system are not chosen properly.  ...  Since the secret key is hereby riot fourid this attack shows that forging ElGamal signatures is sometimes easier than the underlying discrete logarithm problem.  ...  Acknowledgments I'm grateful t o Ueli Maurer, Markus Stadler, Holger Pctersen Markus Michels and some members of the EUROCRYPT program committee for their cornmerits arid suggestions.  ... 
doi:10.1007/3-540-68339-9_2 fatcat:43nkpw76dfgrzjfrktuvld246u

The suffix-signature method for searching for phrases in text

Mei Zhou, Frank Wm. Tompa
1998 Information Systems  
It givas t lie average niiriil)trr of l d s assigner1 for word sigriatiires. tlie tot d iiiiniher of adjaceiit collisioris. the t o t d ~iiiuibsr of breaking points for i-word phrases. a~i d the total  ...  The averagc of the worst case perforrua~ice over d l ( i -1)-worcl prefutes is labeled as ariifonr~, s o r d J i g n a t u r e s .  ...  We also List the niirubers of adjacent collisioris. breakirig point S. and guarariteeing phases.  ... 
doi:10.1016/s0306-4379(98)00029-5 fatcat:wq45x3wgifejdbqfslqgxnhlha

Practical-Sized Instances of Multivariate PKCs: Rainbow, TTS, and ℓIC-Derivatives [chapter]

Anna Inn-Tung Chen, Chia-Hsin Owen Chen, Ming-Shing Chen, Chen-Mou Cheng, Bo-Yin Yang
2008 Lecture Notes in Computer Science  
We present instances of MPKCs (multivariate public key cryptosystems) with design, given the best attacks we know, and implement them on commodity PC hardware.  ...  In fact, they can be up to an order of magnitude faster.  ...  Acknowledgements The authors thank Prof. Jintai Ding and Pei-Yuan Wu for invaluable comments and discussions, and also to National Science Council for sponsorship under Grant 96-2221-E-001-031-MY3.  ... 
doi:10.1007/978-3-540-88403-3_7 fatcat:i7w7nqtljzcejnxtrztk7u57pa

A public key management scheme and threshold-multisignature scheme for mobile ad hoc networks

J. van der Merwe, D.S. Dawoud, S. McDonald
2006 SAIEE Africa Research Journal  
group, The group signature is publicly veri liable and allows any outsider to establish the identity or the individual signers, Tbe paper proposes a .l' elj~ccrlij;ed pllhlic key i.l'.I'lii/lg prolocol  ...  lold-1Il11lli.l'igllalll/'c scheme designed speeilically lor mobile ad hoc networks, The signature scheme allows a subset or shareholders with threshold I. to sign an arbitrary message on behalr or the  ...  L,,)modq IT -ID L/ Ji = k mod q k -fJ.k"'i 1D i -ID k (4) lEO. iE(J. lEU The set (.1',. r,) is the individual signature of P, on message m, which is broadcast to all other group members. s =LH(I11,R,  ... 
doi:10.23919/saiee.2006.9488029 fatcat:3o7kdtlhqngkbifn7w4azd22nq

Robust IP watermarking methodologies for physical design

Andrew B. Kahng, Stefanus Mantik, Igor L. Markov, Miodrag Potkonjak, Paul Tucker, Huijuan Wang, Gregory Wolfe
1998 Proceedings of the 35th annual conference on Design automation conference - DAC '98  
The solution of the optimization instance, in satisfying these constraints (which would be unlikely in a random solution to the original instance), implicitly contains a proof of authorship.  ...  In [5] , we list other watermarking desiderata, and describe a canonical approach to watermarking-based IPP where additional constraints encoding the IP author's signature are added into a given design  ...  Given a routed design, we evaluate the total wirelength (W L tot ) and the wrong-way wirelength (W L way ) for each signal net.  ... 
doi:10.1145/277044.277241 dblp:conf/dac/KahngMMPTWW98 fatcat:m2xuowqnsvcf7gnh5yg64sbok4

LoMoS: Less-online/More-offline Signatures for Extremely Time-critical Systems

Ertem Esiner, Utku Tefek, Hasan S. M. Erol, Daisuke Mashima, Binbin Chen, Yih-Chun Hu, Zbigniew Kalbarczyk, David M. Nicol
2022 IEEE Transactions on Smart Grid  
Inspired by the Online/Offline signatures, this paper presents a new digital signature model to provide the key properties of digital signatures within the delay requirements, hinting that this step back  ...  The Online/Offline signatures concept divides the signature generation into two phases; offline (before the message is given), online (using the outputs of the former for faster signing after the message  ...  The LoMoS construction incurs m+2 to hash the nonces, 3(m+2)+2log(l) to compute the root, totaling 4m + 2log(x) + 2log(m + 1) + 8.  ... 
doi:10.1109/tsg.2022.3156897 fatcat:hojjxjby2feijg25oim6kk4nha

Robust Threshold DSS Signatures [chapter]

Rosario Gennaro, Stanisław Jarecki, Hugo Krawczyk, Tal Rabin
1996 Lecture Notes in Computer Science  
We prove thc security of our schemes solely based on the hardness of forging a regular DSS signature.  ...  This results in a highly secure and resilient DSS signature system applicable to the protection of the secret signature key, the prevention of forgery, and increased system availability.  ...  Each player P i holds a share ki corresponding to a ( t , n ) secret sharing of k , namely, ( k l l . . . k n ) +-L k. The computation of shares for Ic-l is accomplished as follows. ( t n ) 1.  ... 
doi:10.1007/3-540-68339-9_31 fatcat:ykm5xcfoonc2vbpxaod7a7yhia
« Previous Showing results 1 — 15 out of 18,586 results