Non-Interactive Zero-Knowledge(NIZK for short) proofs are fascinating and extremely useful in many security protocols. In this paper,a new group signature scheme,decisional linear assumption group signature(DLAGS for ...Non-Interactive Zero-Knowledge(NIZK for short) proofs are fascinating and extremely useful in many security protocols. In this paper,a new group signature scheme,decisional linear assumption group signature(DLAGS for short) with NIZK proofs is proposed which can prove and sign the multiple values rather than individual bits based on DLIN assumption. DLAGS does not need to interact between the verifier and issuer,which can decrease the communication times and storage cost compared with the existing interactive group signature schemes. We prove and sign the blocks of messages instead of limiting the proved message to only one bit(0 or 1) in the conventional non-interactive zero-knowledge proof system,and we also prove that our scheme satisfy the property of anonymity,unlinkability and traceability. Finally,our scheme is compared with the other scheme(Benoitt's scheme) which is also based on the NIZK proofs system and the DLIN assumption,and the results show that our scheme requires fewer members of groups and computational times.展开更多
Atomic Cross-Chain Swap(ACCS)is one important topic in cryptocurrency,where users can securely and trustlessly exchange assets between two different blockchains.However,most known ACCS schemes assume specific scriptin...Atomic Cross-Chain Swap(ACCS)is one important topic in cryptocurrency,where users can securely and trustlessly exchange assets between two different blockchains.However,most known ACCS schemes assume specific scripting functionalities of the underlying blockchains,such as Hash Time Locked Contracts(HTLC).In addition,these schemes are typically only applicable to certain digital signature schemes,like Schnorr or Elliptic Curve Digital Signature Algorithm(ECDSA)signatures.In this paper,we propose a generic ACCS scheme,independent from the underlying blockchains.To the best of our knowledge,this is the first solution of this kind.Our results are as follows.First,we define a formal system model of ACCS.Next,we present a generic ACCS scheme meets our model.This scheme admits atomicity in cross-chain swaps without the need for a Trusted Third Party(TTP)and protects users’privacy.Finally,by using the Non-Interactive Zero-Knowledge(NIZK)proof protocol as a tool,we instantiate our generic scheme for Elliptic Curve Discrete Logarithm Problem-based(ECDLP-based)signatures.In addition,we implement our scheme,and the experimental results show that our protocol outperforms the existing ACCS schemes,such as the HTLC-based schemes.展开更多
基金supported by the National High-Tech Research and Development Plan of China under Grant Nos.863-317-01- 04-99, 2009AA01Z122 (863)the Natural Science Foundation of Shenyang City of China under Grant No. F10-205-1-12
文摘Non-Interactive Zero-Knowledge(NIZK for short) proofs are fascinating and extremely useful in many security protocols. In this paper,a new group signature scheme,decisional linear assumption group signature(DLAGS for short) with NIZK proofs is proposed which can prove and sign the multiple values rather than individual bits based on DLIN assumption. DLAGS does not need to interact between the verifier and issuer,which can decrease the communication times and storage cost compared with the existing interactive group signature schemes. We prove and sign the blocks of messages instead of limiting the proved message to only one bit(0 or 1) in the conventional non-interactive zero-knowledge proof system,and we also prove that our scheme satisfy the property of anonymity,unlinkability and traceability. Finally,our scheme is compared with the other scheme(Benoitt's scheme) which is also based on the NIZK proofs system and the DLIN assumption,and the results show that our scheme requires fewer members of groups and computational times.
基金supported by National Natural Science Foundation of China(Nos.62172404,62172411,61972094,62202458).
文摘Atomic Cross-Chain Swap(ACCS)is one important topic in cryptocurrency,where users can securely and trustlessly exchange assets between two different blockchains.However,most known ACCS schemes assume specific scripting functionalities of the underlying blockchains,such as Hash Time Locked Contracts(HTLC).In addition,these schemes are typically only applicable to certain digital signature schemes,like Schnorr or Elliptic Curve Digital Signature Algorithm(ECDSA)signatures.In this paper,we propose a generic ACCS scheme,independent from the underlying blockchains.To the best of our knowledge,this is the first solution of this kind.Our results are as follows.First,we define a formal system model of ACCS.Next,we present a generic ACCS scheme meets our model.This scheme admits atomicity in cross-chain swaps without the need for a Trusted Third Party(TTP)and protects users’privacy.Finally,by using the Non-Interactive Zero-Knowledge(NIZK)proof protocol as a tool,we instantiate our generic scheme for Elliptic Curve Discrete Logarithm Problem-based(ECDLP-based)signatures.In addition,we implement our scheme,and the experimental results show that our protocol outperforms the existing ACCS schemes,such as the HTLC-based schemes.
