Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Powiadomienia systemowe
  • Sesja wygasła!

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  ring signature
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
Recently, blockchain technology has garnered a great deal of support; however, an attenuating factor to its global adoption in certain use cases is privacypreservation (owing to its inherent transparency). A widely explored cryptographic option to address this challenge has been a ring signature that, aside from its privacy guarantee, must be double-spending resistant. In this paper, we identify and prove a catastrophic flaw for double-spending attacks in a lightweight ring signature scheme and proceed to construct a new fortified commitment scheme that uses a signer’s entire private key. Subsequently, we compute a stronger key image to yield a double-spending-resistant signature scheme that is solidly backed by formal proof. Inherent in our solution is a novel, zero-knowledge-based, secure, and cost-effective smart contract for public key aggregation. We test our solution on a private blockchain as well as a Kovan testnet along with a performance analysis that attests to its efficiency and usability – and, we make the code publicly available on GitHub.
EN
In this paper, we propose a new and efficient short signature scheme from the bilinear pairings. Our scheme is constructed by bilinear inverse-square Diffie-Hellman problem (BISDHP) and does not require any special hash function. The exact security proofs are also explained in the random Oracle model. We give the implementation and comparison results of our proposed signature scheme with the signature scheme proposed by Boneh, Lynn, Shacham (BLS) and Zhang, Safavi, Susilo (ZSS). Furthermore, we use this signature scheme to construct a ring signature scheme.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.