maintenance of research-lab

* Replace the e-mail with Matrix/IRC link.
* Add new research from cypherstack.
* Add link to MoneroResearch.info
This commit is contained in:
HardenedSteel 2024-10-25 10:10:00 +03:00
parent 5d5bf86221
commit 4aafcbf076
No known key found for this signature in database
GPG Key ID: BBC3021566F4144D
2 changed files with 32 additions and 4 deletions

View File

@ -851,8 +851,11 @@ roadmap:
research-lab: research-lab:
intro: Monero is not only committed to making a fungible currency, but also to continued research into the realm of financial privacy as it involves cryptocurrencies. Below you'll find the work of our very own Monero Research Lab, with more papers to come. intro: Monero is not only committed to making a fungible currency, but also to continued research into the realm of financial privacy as it involves cryptocurrencies. Below you'll find the work of our very own Monero Research Lab, with more papers to come.
intro_email: "To contact the Monero Research Lab, please email lab@getmonero.org." intro_contact: "To contact the Monero Research Lab, please join our <a href='https://matrix.to/#/#monero-research-lab:monero.social'>Matrix</a>/<a href='irc://irc.libera.chat/#monero-research-lab'>IRC channel</a>"
mrl_papers: Published Papers mrl_papers: Papers Written by MRL Researchers
related_mrl_papers: Papers Related to Monero
papersbutton: Visit MoneroResearch.info
papersp: Explore a broad range of research papers related to Monero.
abstract: Abstract abstract: Abstract
introduction: Introduction introduction: Introduction
read-paper: Read Paper read-paper: Read Paper
@ -886,6 +889,8 @@ research-lab:
iacr2020312: "Arcturus: efficient proofs for confidential transactions" iacr2020312: "Arcturus: efficient proofs for confidential transactions"
iacr2020312_note: "NOTE: this paper has been retracted, but it's possible to view it clicking on 'All versions of this report'." iacr2020312_note: "NOTE: this paper has been retracted, but it's possible to view it clicking on 'All versions of this report'."
iacr2020312_abstract: Confidential transactions are used in distributed digital assets to demonstrate the balance of values hidden in commitments, while retaining signer ambiguity. Previous work describes a signer-ambiguous proof of knowledge of the opening of commitments to zero at the same index across multiple public commitment sets and the evaluation of a verifiable random function used as a linking tag, and uses this to build a linkable ring signature called Triptych that can be used as a building block for a confidential transaction model. In this work, we extend Triptych to build Arcturus, a proving system that proves knowledge of openings of multiple commitments to zero within a single set, correct construction of a verifiable random function evaluated at each opening, and value balance across a separate list of commitments within a single proof. While soundness depends on a novel dual discrete-logarithm hardness assumption, we use data from the Monero blockchain to show that Arcturus can be used in a confidential transaction model to provide faster total batch verification time than other state-of-the-art constructions without a trusted setup. iacr2020312_abstract: Confidential transactions are used in distributed digital assets to demonstrate the balance of values hidden in commitments, while retaining signer ambiguity. Previous work describes a signer-ambiguous proof of knowledge of the opening of commitments to zero at the same index across multiple public commitment sets and the evaluation of a verifiable random function used as a linking tag, and uses this to build a linkable ring signature called Triptych that can be used as a building block for a confidential transaction model. In this work, we extend Triptych to build Arcturus, a proving system that proves knowledge of openings of multiple commitments to zero within a single set, correct construction of a verifiable random function evaluated at each opening, and value balance across a separate list of commitments within a single proof. While soundness depends on a novel dual discrete-logarithm hardness assumption, we use data from the Monero blockchain to show that Arcturus can be used in a confidential transaction model to provide faster total batch verification time than other state-of-the-art constructions without a trusted setup.
cypherstack202410: Uniformly Most Powerful Tests For Ad Hoc Transactions In Monero
cypherstack202410_abstract: We introduce a general, low-cost, low-power statistical test for transactions in transaction protocols with small anonymity set authentication (TPSASAs), such as Monero. The test classifies transactions as ad hoc (spontaneously constructed to spend a deterministically selected key) or self-churned (constructed from a probability distribution very close to that of the default wallet software, and with the same sender and receiver). The test is a uniformly most powerful (UMP) likelihood ratio tests (LRT) from the Neyman-Pearson Lemma, and makes no assumptions about user behavior. We extend these tests to exploit prior information about user behavior. We discuss test parameterization, as well as how anonymity set cardinality and user behavior impact test performance. We also describe a maximum-likelihood de-anonymization attack on Monero based on our test.
cryptonote: Cryptonote Whitepapers cryptonote: Cryptonote Whitepapers
cryptonote-whitepaper: Cryptonote Whitepaper cryptonote-whitepaper: Cryptonote Whitepaper
cryptonote-whitepaper_para: This is the original cryptonote paper written by the cryptonote team. Reading it will give an understanding about how the cryptonote algorithm works in general. cryptonote-whitepaper_para: This is the original cryptonote paper written by the cryptonote team. Reading it will give an understanding about how the cryptonote algorithm works in general.

View File

@ -6,17 +6,40 @@ meta_descr: meta_descr.mrl
--- ---
{% t global.lang_tag %} {% t global.lang_tag %}
<div class="container description"> <div class="container description">
<p>{% t research-lab.intro %} {% t research-lab.intro_email %}</p> <p>{% t research-lab.intro %} {% t research-lab.intro_contact %}</p>
</div> </div>
<section class="container"> <section class="container">
<div class="row"> <div class="row">
<!-- left two-thirds block--> <!-- left two-thirds block-->
<div class="left two-thirds col-lg-8 col-md-8 col-sm-8 col-xs-12"> <div class="left col-lg-8 col-md-8 col-sm-8 col-xs-12">
<div class="info-block related-research-paper">
<div class="row center-xs">
<div class="col">
<h2>{% t research-lab.related_mrl_papers %}</h2>
<div>
<p>{% t research-lab.papersp %}</p><br>
<div class="center-xs">
<a class="btn-link btn-auto btn-primary" href="https://moneroresearch.info/">{% t research-lab.papersbutton %}</a>
</div>
</div>
</div>
</div>
</div>
<div class="info-block research-paper"> <div class="info-block research-paper">
<div class="row center-xs"> <div class="row center-xs">
<div class="col"><h2>{% t research-lab.mrl_papers %}</h2></div> <div class="col"><h2>{% t research-lab.mrl_papers %}</h2></div>
</div> </div>
<div class="tab"> <div class="tab">
<div class="tab">
<input id="cypherstack202410" type="checkbox" name="tabs" class="accordion">
<label for="cypherstack202410" class="accordion">{% t research-lab.cypherstack202410 %}</label>
<div class="tab-content">
<p><strong>{% t research-lab.abstract %}:</strong> {% t research-lab.cypherstack202410_abstract %}</p>
<div class="center-xs">
<p><a class="btn-link btn-auto btn-primary" target="_blank" rel="noreferrer noopener" href="https://github.com/cypherstack/churn/releases/download/final/Churn-final.pdf">{% t research-lab.read-paper %}</a></p>
</div>
</div>
</div>
<input id="tab-2020312" type="checkbox" name="tabs" class="accordion"> <input id="tab-2020312" type="checkbox" name="tabs" class="accordion">
<label for="tab-2020312" class="accordion">IACR 2020/312: {% t research-lab.iacr2020312 %}</label> <label for="tab-2020312" class="accordion">IACR 2020/312: {% t research-lab.iacr2020312 %}</label>
<div class="tab-content"> <div class="tab-content">