Search Results

Documents authored by Burcsi, Péter

Found 2 Possible Name Variants:

Burcsi, Péter

Document
DOI: 10.4230/OASIcs.Tokenomics.2019.13
MixEth: Efficient, Trustless Coin Mixing Service for Ethereum

Authors: István András Seres, Dániel A. Nagy, Chris Buckland, and Péter Burcsi

Published in: OASIcs, Volume 71, International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2019)

Abstract
Coin mixing is a prevalent privacy-enhancing technology for cryptocurrency users. In this paper, we present MixEth, which is a trustless coin mixing service for Turing-complete blockchains. MixEth does not rely on a trusted setup and is more efficient than any proposed trustless coin tumbler. It requires only 3 on-chain transactions at most per user and 1 off-chain message. It achieves strong notions of anonymity and is able to resist denial-of-service attacks. Furthermore the underlying protocol can also be used to efficiently shuffle ballots, ciphertexts in a trustless and decentralized manner.
Cite as

István András Seres, Dániel A. Nagy, Chris Buckland, and Péter Burcsi. MixEth: Efficient, Trustless Coin Mixing Service for Ethereum. In International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2019). Open Access Series in Informatics (OASIcs), Volume 71, pp. 13:1-13:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{seres_et_al:OASIcs.Tokenomics.2019.13,
  author =	{Seres, Istv\'{a}n Andr\'{a}s and Nagy, D\'{a}niel A. and Buckland, Chris and Burcsi, P\'{e}ter},
  title =	{{MixEth: Efficient, Trustless Coin Mixing Service for Ethereum}},
  booktitle =	{International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2019)},
  pages =	{13:1--13:20},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-108-5},
  ISSN =	{2190-6807},
  year =	{2020},
  volume =	{71},
  editor =	{Danos, Vincent and Herlihy, Maurice and Potop-Butucaru, Maria and Prat, Julien and Tucci-Piergiovanni, Sara},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.Tokenomics.2019.13},
  URN =		{urn:nbn:de:0030-drops-119770},
  doi =		{10.4230/OASIcs.Tokenomics.2019.13},
  annote =	{Keywords: Cryptography, Verifiable shuffle, Anonymity, Cryptocurrency, Ethereum, Coin mixer, State Channel}
}
Document
DOI: 10.4230/LIPIcs.CPM.2016.10
Reconstruction of Trees from Jumbled and Weighted Subtrees

Authors: Dénes Bartha, Peter Burcsi, and Zsuzsanna Lipták

Published in: LIPIcs, Volume 54, 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016)

Abstract
Let T be an edge-labeled graph, where the labels are from a finite alphabet Sigma. For a subtree U of T the Parikh vector of U is a vector of length |Sigma| which specifies the multiplicity of each label in U. We ask when T can be reconstructed from the multiset of Parikh vectors of all its subtrees, or all of its paths, or all of its maximal paths. We consider the analogous problems for weighted trees. We show how several well-known reconstruction problems on labeled strings, weighted strings and point sets on a line can be included in this framework. We present reconstruction algorithms and non-reconstructibility results, and extend the polynomial method, previously applied to jumbled strings [Acharya et al., SIAM J. on Discr. Math, 2015] and weighted strings [Bansal et al., CPM 2004], to deal with general trees and special tree classes.
Cite as

Dénes Bartha, Peter Burcsi, and Zsuzsanna Lipták. Reconstruction of Trees from Jumbled and Weighted Subtrees. In 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 54, pp. 10:1-10:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@InProceedings{bartha_et_al:LIPIcs.CPM.2016.10,
  author =	{Bartha, D\'{e}nes and Burcsi, Peter and Lipt\'{a}k, Zsuzsanna},
  title =	{{Reconstruction of Trees from Jumbled and Weighted Subtrees}},
  booktitle =	{27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016)},
  pages =	{10:1--10:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-012-5},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{54},
  editor =	{Grossi, Roberto and Lewenstein, Moshe},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2016.10},
  URN =		{urn:nbn:de:0030-drops-60861},
  doi =		{10.4230/LIPIcs.CPM.2016.10},
  annote =	{Keywords: trees, paths, Parikh vectors, reconstruction problems, homometric sets, polynomial method, jumbled strings, weighted strings}
}

Burcsi, Peter

Document
DOI: 10.4230/OASIcs.Tokenomics.2019.13
MixEth: Efficient, Trustless Coin Mixing Service for Ethereum

Authors: István András Seres, Dániel A. Nagy, Chris Buckland, and Péter Burcsi

Published in: OASIcs, Volume 71, International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2019)

Abstract
Coin mixing is a prevalent privacy-enhancing technology for cryptocurrency users. In this paper, we present MixEth, which is a trustless coin mixing service for Turing-complete blockchains. MixEth does not rely on a trusted setup and is more efficient than any proposed trustless coin tumbler. It requires only 3 on-chain transactions at most per user and 1 off-chain message. It achieves strong notions of anonymity and is able to resist denial-of-service attacks. Furthermore the underlying protocol can also be used to efficiently shuffle ballots, ciphertexts in a trustless and decentralized manner.
Cite as

István András Seres, Dániel A. Nagy, Chris Buckland, and Péter Burcsi. MixEth: Efficient, Trustless Coin Mixing Service for Ethereum. In International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2019). Open Access Series in Informatics (OASIcs), Volume 71, pp. 13:1-13:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{seres_et_al:OASIcs.Tokenomics.2019.13,
  author =	{Seres, Istv\'{a}n Andr\'{a}s and Nagy, D\'{a}niel A. and Buckland, Chris and Burcsi, P\'{e}ter},
  title =	{{MixEth: Efficient, Trustless Coin Mixing Service for Ethereum}},
  booktitle =	{International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2019)},
  pages =	{13:1--13:20},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-108-5},
  ISSN =	{2190-6807},
  year =	{2020},
  volume =	{71},
  editor =	{Danos, Vincent and Herlihy, Maurice and Potop-Butucaru, Maria and Prat, Julien and Tucci-Piergiovanni, Sara},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.Tokenomics.2019.13},
  URN =		{urn:nbn:de:0030-drops-119770},
  doi =		{10.4230/OASIcs.Tokenomics.2019.13},
  annote =	{Keywords: Cryptography, Verifiable shuffle, Anonymity, Cryptocurrency, Ethereum, Coin mixer, State Channel}
}
Document
DOI: 10.4230/LIPIcs.CPM.2016.10
Reconstruction of Trees from Jumbled and Weighted Subtrees

Authors: Dénes Bartha, Peter Burcsi, and Zsuzsanna Lipták

Published in: LIPIcs, Volume 54, 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016)

Abstract
Let T be an edge-labeled graph, where the labels are from a finite alphabet Sigma. For a subtree U of T the Parikh vector of U is a vector of length |Sigma| which specifies the multiplicity of each label in U. We ask when T can be reconstructed from the multiset of Parikh vectors of all its subtrees, or all of its paths, or all of its maximal paths. We consider the analogous problems for weighted trees. We show how several well-known reconstruction problems on labeled strings, weighted strings and point sets on a line can be included in this framework. We present reconstruction algorithms and non-reconstructibility results, and extend the polynomial method, previously applied to jumbled strings [Acharya et al., SIAM J. on Discr. Math, 2015] and weighted strings [Bansal et al., CPM 2004], to deal with general trees and special tree classes.
Cite as

Dénes Bartha, Peter Burcsi, and Zsuzsanna Lipták. Reconstruction of Trees from Jumbled and Weighted Subtrees. In 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 54, pp. 10:1-10:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@InProceedings{bartha_et_al:LIPIcs.CPM.2016.10,
  author =	{Bartha, D\'{e}nes and Burcsi, Peter and Lipt\'{a}k, Zsuzsanna},
  title =	{{Reconstruction of Trees from Jumbled and Weighted Subtrees}},
  booktitle =	{27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016)},
  pages =	{10:1--10:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-012-5},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{54},
  editor =	{Grossi, Roberto and Lewenstein, Moshe},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2016.10},
  URN =		{urn:nbn:de:0030-drops-60861},
  doi =		{10.4230/LIPIcs.CPM.2016.10},
  annote =	{Keywords: trees, paths, Parikh vectors, reconstruction problems, homometric sets, polynomial method, jumbled strings, weighted strings}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact