Commit c65e4884 authored by Sarang Noether's avatar Sarang Noether
Browse files

Update CLSAG paper

parent 8d365873
......@@ -522,8 +522,8 @@ research-lab:
mrl9_abstract: We present threshold ring multi-signatures (thring signatures) for collaborative computation of ring signatures, present a game of existential forgery for thring signatures, and discuss uses of thring signatures in digital currencies that include spender-ambiguous cross-chain atomic swaps for confidential amounts without a trusted setup. We present an implementation of thring signatures that we call linkable spontaneous threshold anonymous group signatures, and prove the implementation existentially unforgeable.
mrl10: Discrete Logarithm Equality Across Groups
mrl10_abstract: This technical note describes an algorithm used to prove knowledge of the same discrete logarithm across different groups. The scheme expresses the common value as a scalar representation of bits, and uses a set of ring signatures to prove each bit is a valid value that is the same (up to an equivalence) across both scalar groups.
mrl11: Compact linkable ring signatures and applications
mrl11_abstract: We describe an efficient linkable ring signature scheme, compact linkable spontaneous anonymous group (CLSAG) signatures, for use in confidential transactions. Compared to the existing signature scheme used in Monero, CLSAG signatures are both smaller and more efficient to generate and verify for ring sizes of interest. We generalize the construction and show how it can be used to produce signatures with coins of different type in the same transaction.
iacr2019654: Concise Linkable Ring Signatures and Forgery Against Adversarial Keys
iacr2019654_abstract: We demonstrate that a version of non-slanderability is a natural definition of unforgeability for linkable ring signatures. We present a linkable ring signature construction with concise signatures and multi-dimensional keys that is linkably anonymous if a variation of the decisional Diffie-Hellman problem with random oracles is hard, linkable if key aggregation is a one-way function, and non-slanderable if a one-more variation of the discrete logarithm problem is hard. We remark on some applications in signer-ambiguous confidential transaction models without trusted setup.
iacr2020018: "Triptych: logarithmic-sized linkable ring signatures with applications"
iacr2020018_abstract: Ring signatures are a common construction used to provide signer ambiguity among a non-interactive set of public keys specified at the time of signing. Unlike early approaches where signature size is linear in the size of the signer anonymity set, current optimal solutions either require centralized trusted setups or produce signatures logarithmic in size. However, few also provide linkability, a property used to determine whether the signer of a message has signed any previous message, possibly with restrictions on the anonymity set choice. Here we introduce Triptych, a family of linkable ring signatures without trusted setup that is based on generalizations of zero-knowledge proofs of knowledge of commitment openings to zero. We demonstrate applications of Triptych in signer-ambiguous transaction protocols by extending the construction to openings of parallel commitments in independent anonymity sets. Signatures are logarithmic in the anonymity set size and, while verification complexity is linear, collections of proofs can be efficiently verified in batches. We show that for anonymity set sizes practical for use in distributed protocols, Triptych offers competitive performance with a straightforward construction.
iacr2020312: "Triptych-2: efficient proofs for confidential transactions"
......
......@@ -36,12 +36,12 @@ permalink: /resources/research-lab/index.html
</div>
</div>
<div class="tab">
<input id="tab-12" type="checkbox" name="tabs" class="accordion">
<label for="tab-12" class="accordion">MRL-0011: {% t research-lab.mrl11 %}</label>
<input id="tab-2019654" type="checkbox" name="tabs" class="accordion">
<label for="tab-2019654" class="accordion">IACR 2019/654: {% t research-lab.iacr2019654 %}</label>
<div class="tab-content">
<p><strong>{% t research-lab.abstract %}:</strong> {% t research-lab.mrl11_abstract %}
<p><strong>{% t research-lab.abstract %}:</strong> {% t research-lab.iacr2019654_abstract %}
<br>
<a target="_blank" rel="noreferrer noopener" href="{{site.baseurl}}/resources/research-lab/pubs/MRL-0011.pdf">{% t research-lab.read-paper %}</a>
<a target="_blank" rel="noreferrer noopener" href="https://eprint.iacr.org/2019/654">{% t research-lab.read-paper %}</a>
</p>
</div>
</div>
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment