Getmonero

monero-site

Serbian

Translate

Zen

	Key	English	Serbian	Actions
	research-lab->iacr2020018	Triptych: logarithmic-sized linkable ring signatures with applications	Triptych: logaritamski povezujući prstenasti potpisi i njihova primena
	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.	Prstenasti potpisi su uobičajena konstrukcija koja se koristi za obezbeđivanje dvosmislenosti potpisnika među ne-interaktivnim skupom javnih ključeva navedenim u trenutku potpisivanja. Za razliku od ranih pristupa gde je veličina potpisa linearna u veličini skupa anonimnosti potpisnika, trenutna optimalna rešenja zahtevaju centralizovane pouzdane postavke ili proizvode potpise logaritamske veličine. Međutim, malo njih nudi i povezivost, svojstvo koje se koristi da bi se utvrdilo da li je potpisnik poruke potpisao bilo koju prethodnu poruku, moguće uz ograničenje izbora skupa anonimnosti. Ovde predstavljamo Triptych, porodicu povezanih prstenastih potpisa bez potrebe za centralizovanom i pouzdanom postavkom, koja se zasniva na uopštenosti nultog znanja dokaza "zero-knowledge proofs", o znanju otvaranja obaveza prema nuli. Demonstriramo primenu Triptych-a u dvosmislenim protokolima transakcija potpisnika proširujući konstrukciju na otvaranja paralelnih obaveza u nezavisnim skupovima anonimnosti. Potpisi su logaritamski u veličini skupa anonimnosti i, iako je složenost verifikacije linearna, skupovi dokaza mogu se efikasno verifikovati u grupama. Pokazujemo da u smislu praktičnosti veličine skupova anonimnosti koje koriste distribuirani protokoli, Triptych pruža konkurentske performanse čak i uz jednostavnu implementaciju.
	research-lab->iacr2020312	Arcturus: efficient proofs for confidential transactions	Arcturus: efikasni dokazi za poverljive transakcije
	research-lab->iacr2020312_note	NOTE: this paper has been retracted, but it's possible to view it clicking on 'All versions of this report'.
	research-lab->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.	Poverljive transakcije se koriste u distribuiranim digitalnim sredstvima da bi se pokazao bilans vrednosti skriven u obavezama, zadržavajući pritom dvosmislenost potpisnika. Prethodni rad je opisao dokaz o saznanju o otvaranju obaveze nultog iznosa uz uvažavanje dvosmislenosti potpisnika sa istim indeksom za ceo skup javnih obaveza, i procenu proverljive nasumične funkcije koja se koristi kao oznaka za povezivanje i koristi se za izgradnju povezivog prstenastog potpisa tzv. Triptych, koji može poslužiti kao sastavni elementu u izgradnji modela poverljive transakcije. U ovom radu proširujemo Triptych na izgradnju Arcturus-a, sistema dokaza o znanju za otkrića više obaveza sa nultom sumom u okviru jednog skupa, ispravnu konstrukciju proverljive nasumične funkcije koja se procenjuje pri svakom otvaranju i balans vrednosti na zasebnoj listi obaveza u okviru jednog dokaza. Iako ispravnost zavisi od nove pretpostavke robustnosti dvostrukog diskretnog logaritma, koristimo podatke iz Monero blokčejna-a da bismo pokazali da se Arcturus može koristiti modelu poverljivih transakcija kako bi se obezbedilo brže ukupno vreme verifikacije serije blokova od ostalih najsavremenijih metoda bez potrebe za centralizovanom i pouzdanom postavkom.
	research-lab->cryptonote	Cryptonote Whitepapers	Cryptonote Whitepapers
	research-lab->cryptonote-whitepaper	Cryptonote Whitepaper	Cryptonote Whitepaper
	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.	Ovo je originalna cryptonote bela knjiga koju je napisao cryptonote tim. Ovaj rad će vam pružiti bolje razumevanje o tome kako cryptonote algoritam radi.
	research-lab->annotated	Annotated Whitepaper	Annotated Whitepaper
	research-lab->annotated_para	The Monero Research Lab released an annotated version of the cryptonote whitepaper. This is sort of like an informal review of the claims that are made line-by-line of the whitepaper. It also explains some of the harder concepts in relatively easy to understand terms.	Monero Istraživačka Laboratorija je objavila anotiranu verziju bele knjige za cryptonote. Ovo je poput neformalnog pregleda tvrdnji i stavki iznetih red po red u beloj knjizi. Takođe, neki teži koncepti su objašnjeni u relativno lako-razumljivim terminima.
	research-lab->brandon	Brandon Goodell's Whitepaper Review	Brandon Goodell's Whitepaper Review

	Key	English	Serbian	Actions
	research-lab->abstract	Abstract	Sažetak
	research-lab->annotated	Annotated Whitepaper	Annotated Whitepaper
	research-lab->annotated_para	The Monero Research Lab released an annotated version of the cryptonote whitepaper. This is sort of like an informal review of the claims that are made line-by-line of the whitepaper. It also explains some of the harder concepts in relatively easy to understand terms.	Monero Istraživačka Laboratorija je objavila anotiranu verziju bele knjige za cryptonote. Ovo je poput neformalnog pregleda tvrdnji i stavki iznetih red po red u beloj knjizi. Takođe, neki teži koncepti su objašnjeni u relativno lako-razumljivim terminima.
	research-lab->brandon	Brandon Goodell's Whitepaper Review	Brandon Goodell's Whitepaper Review
	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.	Ovaj rad je formalni pregled bele knjige za cryptonote, čiji je autor MRL istraživač Brandon Goodell. On detaljno razmatra tvrdnje i matematiku predstavljene u cryptonote beloj knjizi.
	research-lab->cryptonote	Cryptonote Whitepapers	Cryptonote Whitepapers
	research-lab->cryptonote-whitepaper	Cryptonote Whitepaper	Cryptonote Whitepaper
	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.	Ovo je originalna cryptonote bela knjiga koju je napisao cryptonote tim. Ovaj rad će vam pružiti bolje razumevanje o tome kako cryptonote algoritam radi.
	research-lab->iacr2019654	Concise Linkable Ring Signatures and Forgery Against Adversarial Keys	Sažeti Povezivi Prstenasti Potpisi i Falsifikovanje Naspram Protivničkih Ključeva
	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.	Pokazujemo da je verzija ne-klevete prirodna definicija otpornosti na falsifikovanje za povezane prstenaste potpise. Predstavljamo povezivu konstrukciju prstenastih potpisa sa sažetim potpisima i višedimenzionalnim ključevima koja je povezivo anonimna ako je varijanta odlučujućeg Diffie-Hellman-ovog problema sa nasumičnim heš funkcijama kao modelom dokaza teška. A sa druge strane, poveziva, ako je agregacija ključeva jednosmerna funkcija, i ne-klevetna ako je još jedna varijacija diskretnog logaritma teška. Skrećemo pažnju na primene u poverljivim transakcijama bez oslanjanja na treću stranu.

Loading…

No matching activity found.

Browse all string changes

Things to check

Unchanged translation

Source and translation are identical

Glossary

English	Serbian
No related strings found in the glossary.

String information

Key

research-lab->cryptonote

String age

4 years ago

Last updated

7 months ago

Source string age

4 years ago

Translation file

_i18n/sr.yml, string 782