Getmonero

monero-site

Portuguese (Brazil)

Translate

Zen

Translation

Key research-lab->iacr2019654

English

Portuguese (Brazil)

Needs editing

Skip

	Key	English	Portuguese (Brazil)	Actions
	research-lab->mrl8_abstract	This bulletin describes a modification to Monero's linkable ring signature scheme that permits dual-key outputs as ring members. Key images are tied to both output one-time public keys in a dual, preventing both keys in that transaction from being spent separately. This method has applications to non-interactive refund transactions. We discuss the security implications of the scheme.	This bulletin describes a modification to Monero's linkable ring signature scheme that permits dual-key outputs as ring members. Key images are tied to both output one-time public keys in a dual, preventing both keys in that transaction from being spent separately. This method has applications to non-interactive refund transactions. We discuss the security implications of the scheme.
	research-lab->mrl9	Thring Signatures and their Applications to Spender-Ambiguous Digital Currencies	Thring Signatures and their Applications to Spender-Ambiguous Digital Currencies
	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.	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.
	research-lab->mrl10	Discrete Logarithm Equality Across Groups	Discrete Logarithm Equality Across Groups
	research-lab->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.	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.
	research-lab->iacr2019654	Concise Linkable Ring Signatures and Forgery Against Adversarial Keys	Concise Linkable Ring Signatures and Forgery Against Adversarial Keys
	research-lab->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.	Demonstramos que uma versão que assume a impossibilidade de enganar sob o disfarce de outro usuário é uma definição natural da impossibilidade de forjar uma assinatura em anel vinculado. Oferecemos uma variante de estrutura da assinatura em anel vinculado que permite criar assinaturas curtas e com chaves multidimensionais que serão vinculadas anonimamente sob condição de mudança de complexidade da solução do problema da Diffie-Hellman com os oráculos aleatórios vinculados, caso a agregação de chaves seja uma função unilateral, e também tornará impossível trapacear sob o disfarce de outro usuário se pelo menos uma variante de solução de um problema de logaritmo discreto for difícil. Damos algumas variantes de aplicação dentro dos limites dos modelos de transações confidenciais com ocultação do signatário, não exigindo setups de confiança.
	research-lab->iacr2020018	Triptych: logarithmic-sized linkable ring signatures with applications	Triptych: logarithmic-sized linkable ring signatures with applications
	research-lab->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.	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.
	research-lab->iacr2020312	Arcturus: efficient proofs for confidential transactions	Arcturus: efficient proofs for confidential transactions
	research-lab->iacr2020312_note	NOTE: this paper has been retracted, but it's possible to view it clicking on 'All versions of this report'.

	Key	English	Portuguese (Brazil)	Actions
	research-lab->brandon	Brandon Goodell's Whitepaper Review	Revisão do White Paper por Brandon Goodell
	research-lab->brandon_para	This paper is a formal review of the original cryptonote paper by MRL researcher Brandon Goodell. He takes an in-depth look at the claims and mathematics presented in the cryptonote paper.	Este artigo é uma revisão formal do livro branco do CryptoNote realizado pelo pesquisador Brandon Goodell. Ele analisa profundamente as reivindicações e a matemática apresentadas no documento original.
	research-lab->cryptonote	Cryptonote Whitepapers	White papers do CryptoNote
	research-lab->cryptonote-whitepaper	Cryptonote Whitepaper	White paper do CryptoNote
	research-lab->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.	Este é o artigo original escrito pela equipe do CryptoNote. Sua leitura dá um entendimento básico sobre como funciona o algoritmo do CryptoNote.
	research-lab->iacr2019654	Concise Linkable Ring Signatures and Forgery Against Adversarial Keys	Concise Linkable Ring Signatures and Forgery Against Adversarial Keys
	research-lab->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.	Demonstramos que uma versão que assume a impossibilidade de enganar sob o disfarce de outro usuário é uma definição natural da impossibilidade de forjar uma assinatura em anel vinculado. Oferecemos uma variante de estrutura da assinatura em anel vinculado que permite criar assinaturas curtas e com chaves multidimensionais que serão vinculadas anonimamente sob condição de mudança de complexidade da solução do problema da Diffie-Hellman com os oráculos aleatórios vinculados, caso a agregação de chaves seja uma função unilateral, e também tornará impossível trapacear sob o disfarce de outro usuário se pelo menos uma variante de solução de um problema de logaritmo discreto for difícil. Damos algumas variantes de aplicação dentro dos limites dos modelos de transações confidenciais com ocultação do signatário, não exigindo setups de confiança.
	research-lab->iacr2020018	Triptych: logarithmic-sized linkable ring signatures with applications	Triptych: logarithmic-sized linkable ring signatures with applications
	research-lab->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.	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.
	research-lab->iacr2020312	Arcturus: efficient proofs for confidential transactions	Arcturus: efficient proofs for confidential transactions

Loading…

nelsonrenan Suggestion accepted Getmonero / monero-site — Portuguese (Brazil)	English Concise Linkable Ring Signatures and Forgery Against Adversarial Keys Portuguese (Brazil) 69 characters edited Current translation Concise Linkable Ring Signatures and Forgery Against Adversarial Keys 3 years ago
netrik182 Suggestion added Getmonero / monero-site — Portuguese (Brazil)	English Concise Linkable Ring Signatures and Forgery Against Adversarial Keys Portuguese (Brazil) 69 characters edited Current translation Concise Linkable Ring Signatures and Forgery Against Adversarial Keys 3 years ago
netrik182 Suggestion removed Getmonero / monero-site — Portuguese (Brazil)	English Concise Linkable Ring Signatures and Forgery Against Adversarial Keys Portuguese (Brazil) 82 characters edited Associação de Assinaturas em Anel Concisa e Falsificação Contra Chaves Adversárias 3 years ago
netrik182 Suggestion added Getmonero / monero-site — Portuguese (Brazil)	English Concise Linkable Ring Signatures and Forgery Against Adversarial Keys Portuguese (Brazil) 82 characters edited Associação de Assinaturas em Anel Concisa e Falsificação Contra Chaves Adversárias 3 years ago

Browse all string changes

Things to check

Unchanged translation

Source and translation are identical

Glossary

English	Portuguese (Brazil)
Ring signatures	Assinaturas em anel	Monero CLI & GUI
Ring signatures	Assinaturas em anel	Getmonero

String information

Key

research-lab->iacr2019654

String age

4 years ago

Last updated

8 months ago

Source string age

4 years ago

Translation file

_i18n/pt-br.yml, string 775