298,440 Hits in 4.1 sec

Practical Secret Signature Scheme with No Randomness Saving

Byoungcheon Lee
2013 2013 International Conference on IT Convergence and Security (ICITCS)  
s secret signature scheme such that random number is replaced by a pseudo random number that can be computed only by the signer as a function of signer's private key and timestamp.  ...  This is very impractical in the real world, since random numbers used in many cryptographic algorithms are generally used only once and they have to be removed safely for security reason.  ...  Verification: The receiver, B, uses his private key, x B , to compute the agreed key with the signer, W = U x B . B then verifies V by g V ? = U · y H(m,T,U,W ) A .  ... 
doi:10.1109/icitcs.2013.6717872 dblp:conf/icitcs/Lee13 fatcat:gzxs64wthjfd7g4fiydqqoojkq

Fast and Secure Immunization Against Adaptive Man-in-the-Middle Impersonation [chapter]

Ronald Cramer, Ivan Damgård
1997 Lecture Notes in Computer Science  
Basically, any three-move, public coin identification scheme that is zero knowledge against the honest verifier and that is secure against passive impersonation attacks, is eligible for our transformation  ...  . : a malicious verifier may simply act as a moderator between the prover and yet another verifier, thus enabling the malicious verifier to pass as the prover.  ...  Key Generation A keypair, consisting of a public key and a secret key, for participant X is generated as (x = g W , w ) where w is chosen at random from H,.  ... 
doi:10.1007/3-540-69053-0_7 fatcat:lujiiytcv5fg3cuk6uxu4r7l6e

Round Optimal Distributed Key Generation of Threshold Cryptosystem Based on Discrete Logarithm Problem [chapter]

Rui Zhang, Hideki Imai
2003 Lecture Notes in Computer Science  
the key is not uniformly generated in the key space with a malicious adversary and also a solution is given to deal with such type of adversary.  ...  Our construction generalizes the scope of design of one round key generation protocol to a broad class of encryption schemes with efficient constructions of proofs of fairness.  ...  of fairness, where public randomness is generated by random oracle. 6 Distributed Key Generation for Discrete Logarithm Based Threshold Cryptosystems The scheme The main protocol uses homomorphic encryption  ... 
doi:10.1007/978-3-540-45203-4_8 fatcat:45er6ymncfhizo4ym7u2qwtebe

Mutual Authentication and Session Key Establishment for Secure Communication using Generalized Digital Certificate

Balaji V Durgawad, Mohammed Aijaz Ahmed, D. Rajya Lakshmi, Sayed Abdul Sattar
2017 International Journal of Computer Network and Information Security  
Index Terms-PKI, public key digital certificate, generalized digital certificate, identity forgery, authentication and session key.  ...  Public-key digital certificates are being used in public key infrastructure to provide authentication of the user's public key.  ...  The signer selects at random a private key X such that and computes corresponding public key . The signer then selects a random secrete k excluding 1 and Q-1 such that and computes .  ... 
doi:10.5815/ijcnis.2017.08.04 fatcat:2t73wxypjnb43kh6qv5vznmh3y

Generic Constructions for Strong Designated Verifier Signature

Deng-Guo Feng, Jing Xu, Wei-Dong Chen
2011 Journal of Information Processing Systems  
In this paper we present two generic frame works for constructing strong designated verifier signature schemes from any secure ring signature scheme and any deniable one-pass authenticated key exchange  ...  Compared with similar protocols, the instantiations of our construction achieve improved efficiency.  ...  To do so, V chooses random values k', r', Key Generation: We denote by ( S N , S e ) and ( V N , V e ) the signer S's and the verifier V's public keys, respectively, and by d S and d V the respective  ... 
doi:10.3745/jips.2011.7.1.159 fatcat:ukep5qmpgvarbik5e7ess4guoy

Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability [chapter]

Yi Deng, Dongdai Lin
2007 Lecture Notes in Computer Science  
Informally, an InstD-VRF is, in some sense, a verifiable random function [23] with a special public key, which is generated via a (possibly)interactive protocol and contains an instance y ∈ L ∩ {0, 1}  ...  We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short).  ...  Informally, an InstD-VRF is, in some sense, a verifiable random function [23] with a special public key, which is generated via a (possibly)interactive protocol and contains an instance y ∈ L ∩ {0, 1  ... 
doi:10.1007/978-3-540-72540-4_9 fatcat:zyw7wk33ajfqzfpmk5jjsuv74a

Efficient Extension of Standard Schnorr/RSA Signatures into Universal Designated-Verifier Signatures [chapter]

Ron Steinfeld, Huaxiong Wang, Josef Pieprzyk
2004 Lecture Notes in Computer Science  
the existing key generation and signing implementation infrastructure for these schemes can be used without modification.  ...  Universal Designated-Verifier Signature (UDVS) schemes are digital signature schemes with additional functionality which allows any holder of a signature to designate the signature to any desired designatedverifier  ...  Verifier Key Generation GKV -on input a common parameter string cp, outputs a secret/public key-pair (sk 3 , pk 3 ) for verifier. 4.  ... 
doi:10.1007/978-3-540-24632-9_7 fatcat:nx3gemqhszc5rj5pz2vqmff544

(Strong) multidesignated verifiers signatures secure against rogue key attack

Man Ho Au, Guomin Yang, Willy Susilo, Yunmei Zhang
2013 Concurrency and Computation  
of ℓ i with overwhelming probability.  ...  Secondly, we propose a generic construction of strong MDVS.  ...  is a designated verifier signature of m with respect to the public key pk S . valid/invalid ← Verify(pk S , σ, V, m, sk V ) : On input a public key pk S , a message m, a signature σ with a set of designated  ... 
doi:10.1002/cpe.3094 fatcat:4cilfw2jgrcprmhsrl66yfd7jq

A Robust Verifiably Encrypted Signature Scheme [chapter]

Jianhong Zhang, Wei Zou
2006 Lecture Notes in Computer Science  
Subsequently, a novel verifiably encrypted signature scheme (VES) is proposed and the scheme is proven secure in random oracle model.  ...  Recently, Gu gave an ID-based verifiably encrypted signature scheme and claimed that their scheme was secure in random oracle model.  ...  Given a public key Q, a message M , an adjudicator's public key Q A and a verifiably encrypted signature δ, verify that δ is a valid verifiably encrypted signature on M under public key Q.  ... 
doi:10.1007/11807964_74 fatcat:afgxarhoqfcrbgwwkjfway3yqm

Short Signature and Universal Designated Verifier Signature Without Random Oracles [chapter]

Rui Zhang, Jun Furukawa, Hideki Imai
2005 Lecture Notes in Computer Science  
key attacks.  ...  We propose the first universal designated verifier signature (UDVS) scheme whose security can be proven without random oracles, whereas the security of all previously known UDVS schemes are proven only  ...  In fact, the public key u 3 of the designated verifier can be replaced by any certified random generator of group G 1 .  ... 
doi:10.1007/11496137_33 fatcat:eturammnznbfja4l4zu5acu62i

Elliptic Curve Cryptography Digital Signature Algorithm For PrivacyPreserving Public Auditing For Shared Data In The Cloud

Vanitha M
2015 International Journal on Recent and Innovation Trends in Computing and Communication  
from public verifiers.  ...  In order to overcome this problem in this paper presents novel privacy-preserving elliptic curve digital signature cryptography methods data integrity with the purpose to maintain public auditing on shared  ...  Generating an Elliptic Curve Verifiably at Random This section describes the technique with the purpose to generating a random number to each cloud user data or information based on the elliptic curve  ... 
doi:10.17762/ijritcc2321-8169.1503130 fatcat:favtdbhq7fhttm5o4aahdbxn2a

Secret Handshakes based on Shortened Versions of DSS

Preeti Kulshrestha, Arun Kumar
2015 International Journal of Computer Applications  
It is shown that proposed schemes are secure under the random oracle model along with comparison of computational complexity of proposed schemes with existing schemes.  ...  A secret handshake protocol allows two users to mutually verify another's authenticity without revealing their own identity.  ...  Pick as random such that 1 < < and compute = . Then the public key is , , , , and private key is . Signature Generation: To sign a message M signer chooses a random number < .  ... 
doi:10.5120/ijca2015907565 fatcat:l43viomh5vgdrd75c3jf5j5zqa

Resettable Cryptography in Constant Rounds – The Case of Zero Knowledge [chapter]

Yi Deng, Dengguo Feng, Vipul Goyal, Dongdai Lin, Amit Sahai, Moti Yung
2011 Lecture Notes in Computer Science  
V 's private input: the randomness r k b used in key generation for one of the public keys. P 's randomness: r p . V 's randomness: r v . 1.  ...  The verifier would first prove knowledge of a long term trapdoor associated with the public key using a zero-knowledge protocol.  ... 
doi:10.1007/978-3-642-25385-0_21 fatcat:aqrlkzfzbbcxvk6s74vypa5ft4

Related Randomness Attacks for Public Key Cryptosystems

Tsz Hon Yuen, Cong Zhang, Sherman S.M. Chow, Siu Ming Yiu
2015 Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security - ASIA CCS '15  
attacks, and related public key attacks.  ...  We initiate the study of related randomness attack in the face of a number of practical attacks in public key cryptography, ranges from active attacks like fault-injection, to passive attacks like software  ...  We start with the Φ-RPA fix-message insecure secure signature scheme Π = (Setup , KeyGen , Sign , Verify ) with Φpublic key malleability.  ... 
doi:10.1145/2714576.2714622 dblp:conf/ccs/YuenZCY15 fatcat:q67pom322vdwvf2fdlptwtlitm

Cryptanalysis and Improvement of Three Certificateless Aggregate Signature Schemes

Xiaodong Yang, Yutong Li, Chunlin Chen, Likun Xiao, Caifen Wang
2018 Mathematical Problems in Engineering  
Chen et al. designed a CLAS scheme with efficient verification and proved that their CLAS scheme was secure in the random oracle model. In this paper, we demonstrate that Li et al.'  ...  Du et al. proposed a CLAS scheme with the constant aggregate signature length and claimed that their scheme was resistant to forgery attacks.  ...  (iii) UserKeyGen: The user with identity generates a public/private key pair ( , ) according to the following steps: (a) Select a random integer ∈ * and compute the public key = .  ... 
doi:10.1155/2018/1908632 fatcat:uycgfslwdzclrnmf5rqx5sg2m4
« Previous Showing results 1 — 15 out of 298,440 results