A comunidade Monero não está comprometida apenas em fazer uma moeda fungível, mas também investe continuamente em pesquisas na área de privacidade financeira em criptomoedas.
A comunidade Monero possui vários membros que são especialistas nos campos de matemática, criptografia aplicada e ciências da computação. Mas isso não é suficiente. Para avançar ainda mais a tecnologia da moeda, a comunidade financia, através de crowdfunding, dois pesquisadores que trabalham no Laboratório de Pesquisas do Monero em tempo integral.
Abaixo você pode conferir um pouco mais sobre os pesquisadores da equipe e os trabalhos que já foram publicados.
Equipe
Atualmente dois pesquisadores altamente qualificados trabalham em tempo integral no Laboratório de Pesquisas do Monero.
Surae Noether (Brandon Goodell)
Pesquisador com pós-doutorado em Ciências Matemáticas pela Universidade de Clemson, mestrado em Matemática na Universidade do Estado de Dakota do Norte e bacharel em Matemática pela Universidade do Estado do Colorado. Participa da comunidade Monero sob o pseudônimo Surae Noether desde 2014. O seu trabalho é financiado pela comunidade Monero desde junho de 2017.
Sarang Noether
Não revela seu nome verdadeiro. Possui grande experiência em criptografia, modelagem de dados, física computacional, matemática teórica. Possui mestrados tanto em matemática quanto em física e irá defender em breve sua tese de pós-doutorado em física computacional. É experiente em C++ e Python, mas também já programou em linguagens como ASP, C, Java, JavaScript, Perl, PHP e outras linguagens. Aplica análise matemática e estatística rigorosa a dados. Já trabalhou com relógios atômicos que são utilizados para o sistema de GPS do Observatório Naval de Washington. Desenvolveu e administrou a infraestrutura de dados na nuvem usada por por vários sistemas de compartilhamento de bicicletas nos EUA. Dá aulas em cursos de criptografia no Programa de Descoberta de Talentos da Universidade de Duke, no Centro para Jovens Talentos da Johns Hopkins, além de outros países. Escreve cursos de design de algoritmos e ciência da computação.
Relatórios mensais:
Papers publicados
MRL-0001: A Note on Chain Reactions in Traceability in CryptoNote 2.0
Resumo: This research bulletin describes a plausible attack on a ring-signature based anonymity system. We use as motivation the cryptocurrency protocol CryptoNote 2.0 ostensibly published by Nicolas van Saberhagen in 2012. It has been previously demonstrated that the untraceability obscuring a one-time key pair can be dependent upon the untraceability of all of the keys used in composing that ring signature. This allows for the possibility of chain reactions in traceability between ring signatures, causing a critical loss in untraceability across the whole network if parameters are poorly chosen and if an attacker owns a sufficient percentage of the network. The signatures are still one-time, however, and any such attack will still not necessarily violate the anonymity of users. However, such an attack could plausibly weaken the resistance CryptoNote demonstrates against blockchain analysis. This research bulletin has not undergone peer review, and reflects only the results of internal investigation.
MRL-0002: Counterfeiting via Merkle Tree Exploits within Virtual Currencies Employing the CryptoNote Protocol
Resumo: On 4 September 2014, an unusual and novel attack was executed against the Monero cryptocurrency network. This attack partitioned the network into two distinct subsets which refused to accept the legitimacy of the other subset. This had myriad effects, not all of which are yet known. The attacker had a short window of time during which a sort of counterfeiting could occur, for example. This research bulletin describes deficiencies in the CryptoNote reference code allowing for this attack, describes the solution initially put forth by Rafal Freeman from Tigusoft.pl and subsequently by the CryptoNote team, describes the current fix in the Monero code base, and elaborates upon exactly what the offending block did to the network. This research bulletin has not undergone peer review, and reflects only the results of internal investigation.
MRL-0003: Monero is Not That Mysterious
Introdução: Recently, there have been some vague fears about the CryptoNote source code and protocol floating around the internet based on the fact that it is a more complicated protocol than, for instance, Bitcoin. The purpose of this note is to try and clear up some misconceptions, and hopefully remove some of the mystery surrounding Monero Ring Signatures. I will start by comparing the mathematics involved in CryptoNote ring signatures (as described in [CN]) to the mathematics in [FS], on which CryptoNote is based. After this, I will compare the mathematics of the ring signature to what is actually in the CryptoNote codebase.
MRL-0004: Improving Obfuscation in the CryptoNote Protocol
Resumo: We identify several blockchain analysis attacks available to degrade the untraceability of the CryptoNote 2.0 protocol. We analyze possible solutions, discuss the relative merits and drawbacks to those solutions, and recommend improvements to the Monero protocol that will hopefully provide long-term resistance of the cryptocurrency against blockchain analysis. Our recommended improvements to Monero include a protocol-level network-wide minimum mix-in policy of n = 2 foreign outputs per ring signature, a protocol-level increase of this value to n = 4 after two years, and a wallet-level default value of n = 4 in the interim. We also recommend a torrent-style method of sending Monero output. We also discuss a non-uniform, age-dependent mix-in selection method to mitigate the other forms of blockchain analysis identified herein, but we make no formal recommendations on implementation for a variety of reasons. The ramifications following these improvements are also discussed in some detail. This research bulletin has not undergone peer review, and reflects only the results of internal investigation.
MRL-0005: Ring Signature Confidential Transactions
Resumo: This article introduces a method of hiding transaction amounts in the strongly decentralized anonymous cryptocurrency Monero. Similar to Bitcoin, Monero is a cryptocurrency which is distributed through a proof of work “mining” process. The original Monero protocol was based on CryptoNote, which uses ring signatures and one-time keys to hide the destination and origin of transactions. Recently the technique of using a commitment scheme to hide the amount of a transaction has been discussed and implemented by Bitcoin Core Developer Gregory Maxwell. In this article, a new type of ring signature, A Multi-layered Linkable Spontaneous Anonymous Group signature is described which allows for hidden amounts, origins and destinations of transactions with reasonable efficiency and verifiable, trustless coin generation. Some extensions of the protocol are provided, such as Aggregate Schnorr Range Proofs, and Ring Multisignature. The author would like to note that early drafts of this were publicized in the Monero Community and on the bitcoin research irc channel. Blockchain hashed drafts are available in [14] showing that this work was started in Summer 2015, and completed in early October 2015. An eprint is also available at http://eprint.iacr.org/2015/1098 .
