Getmonero/monero-site — Chinese (Traditional) @ Weblate: We present threshold ring multi-signatures (thring signatures) for collaborative computation …

Translation

Key research-lab->mrl9_abstract

English

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.

Chinese (Traditional)

Needs editing

Skip

Key	English	Chinese (Traditional)
research-lab->mrl7	Sets of Spent Outputs	Sets of Spent Outputs
research-lab->mrl7_abstract	This technical note generalizes the concept of spend outputs using basic set theory. The definition captures a variety of earlier work on identifying such outputs. We quantify the effects of this analysis on the Monero blockchain and give a brief overview of mitigations.	This technical note generalizes the concept of spend outputs using basic set theory. The definition captures a variety of earlier work on identifying such outputs. We quantify the effects of this analysis on the Monero blockchain and give a brief overview of mitigations.
research-lab->mrl8	Dual Linkable Ring Signatures	Dual Linkable Ring Signatures
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
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.
research-lab->iacr2020018	Triptych: logarithmic-sized linkable ring signatures with applications	Triptych: logarithmic-sized linkable ring signatures with applications

Key	English	Chinese (Traditional)
research-lab->mrl7	Sets of Spent Outputs	Sets of Spent Outputs
research-lab->mrl7_abstract	This technical note generalizes the concept of spend outputs using basic set theory. The definition captures a variety of earlier work on identifying such outputs. We quantify the effects of this analysis on the Monero blockchain and give a brief overview of mitigations.	This technical note generalizes the concept of spend outputs using basic set theory. The definition captures a variety of earlier work on identifying such outputs. We quantify the effects of this analysis on the Monero blockchain and give a brief overview of mitigations.
research-lab->mrl8	Dual Linkable Ring Signatures	Dual Linkable Ring Signatures
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->mrlhtp	Understanding ge_fromfe_frombytes_vartime	Understanding ge_fromfe_frombytes_vartime
research-lab->mrlhtp_summary	Monero uses a unique hash function that transforms scalars into elliptic curve points. It is useful for creating key images, in particular. This document, authored by Shen Noether, translates its code implementation (the ge_fromfe_frombytes_vartime() function) into mathematical expressions.	Monero uses a unique hash function that transforms scalars into elliptic curve points. It is useful for creating key images, in particular. This document, authored by Shen Noether, translates its code implementation (the ge_fromfe_frombytes_vartime() function) into mathematical expressions.
research-lab->mrl_papers	Published Papers	門羅幣研究實驗室的論文 (英文)
research-lab->read-paper	Read Paper	閱讀全文

Loading…

No matching activity found.

Browse all string changes

Things to check

Unchanged translation

Source and translation are identical

Reset

Glossary

English	Chinese (Traditional)
Ring Signatures	環狀簽名	Getmonero

String information

Key

research-lab->mrl9_abstract

String age

4 years ago

Last updated

7 months ago

Source string age

4 years ago

Translation file

_i18n/zh-tw.yml, string 772