default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPéter Ligeti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Fatemeh Stodt
, Mohammed B. M. Kamel, Christoph Reich, Fabrice Theoleyre, Péter Ligeti:
Blockchain-Based Privacy-Preserving Shop Floor Auditing Architecture. IEEE Access 12: 26747-26758 (2024)- [j15]Qiqi Liu, Yuping Yan, Péter Ligeti, Yaochu Jin:
A Secure Federated Data-Driven Evolutionary Multi-Objective Optimization Algorithm. IEEE Trans. Emerg. Top. Comput. Intell. 8(1): 191-205 (2024) - 2023
- [c10]Mohammed B. M. Kamel, Janneke Van Oosterhout, Péter Ligeti, Christoph Reich:
Distributed Cryptography for Lightweight Encryption in Decentralized CP-ABE. WiMob 2023: 476-480 - 2022
- [j14]Mohammed B. M. Kamel, Péter Ligeti, Adam Nagy, Christoph Reich:
Distributed Address Table (DAT): A Decentralized Model for End-to-End Communication in IoT. Peer-to-Peer Netw. Appl. 15(1): 178-193 (2022) - [c9]Mohammed B. M. Kamel, Péter Ligeti, Christoph Reich:
POSTER: ODABE: Outsourced Decentralized CP-ABE in Internet of Things. ACNS Workshops 2022: 611-615 - [c8]Mohammed B. M. Kamel, Yuping Yan, Péter Ligeti, Christoph Reich:
Attribute Verifier for Internet of Things. ITNAC 2022: 1-3 - [c7]Husam Rajab, Mohammed B. M. Kamel, Alaa Khalaf Hamoud, Hossam M. Farag, Tibor Cinkler, Péter Ligeti:
Cognitive Radio for Smart Grid: A Decentralized Emergency Management Approach. ITNAC 2022: 267-272 - [i5]Qiqi Liu, Yuping Yan, Péter Ligeti, Yaochu Jin:
A Secure Federated Data-Driven Evolutionary Multi-objective Optimization Algorithm. CoRR abs/2210.08295 (2022) - 2021
- [j13]Mohammed B. M. Kamel, Péter Ligeti, Christoph Reich:
Lamred: Location-Aware and Privacy Preserving Multi-Layer Resource Discovery for IoT. Acta Cybern. 25(2): 319-349 (2021) - [j12]Máté Gyarmati, Péter Ligeti:
On the information ratio of graphs without high-degree neighbors. Discret. Appl. Math. 304: 55-62 (2021) - [j11]Péter Ligeti, Péter Sziklai, Marcella Takáts:
Generalized threshold secret sharing and finite geometry. Des. Codes Cryptogr. 89(9): 2067-2078 (2021) - [j10]Mohammed B. M. Kamel, Yuping Yan, Péter Ligeti, Christoph Reich:
Attred: Attribute Based Resource Discovery for IoT. Sensors 21(14): 4721 (2021) - 2020
- [j9]Máté Gyarmati, Péter Ligeti:
Smallest Graphs Achieving the Stinson Bound. IEEE Trans. Inf. Theory 66(7): 4609-4612 (2020) - [c6]Mohammed B. M. Kamel, Yuping Yan, Péter Ligeti, Christoph Reich:
A Decentralized Resource Discovery Using Attribute Based Encryption for Internet of Things. CSNet 2020: 1-3 - [c5]Mohammed B. M. Kamel, Kevin Wallis, Péter Ligeti, Christoph Reich:
Distributed data validation network in IoT: a decentralized validator selection model. IOT 2020: 12:1-12:8
2010 – 2019
- 2019
- [j8]László Csirmaz, Péter Ligeti:
Secret sharing on large girth graphs. Cryptogr. Commun. 11(3): 399-410 (2019) - [j7]Károly Harsányi, Péter Ligeti:
Exact information ratios for secret sharing on small graphs with girth at least 5. J. Math. Cryptol. 13(2): 107-116 (2019) - [c4]Mohammed B. M. Kamel, Bruno Crispo, Péter Ligeti:
A Decentralized and Scalable Model for Resource Discovery in IoT Network. WiMob 2019: 1-4 - [i4]Máté Gyarmati, Péter Ligeti:
Smallest graphs achieving the Stinson bound. CoRR abs/1906.11598 (2019) - 2018
- [c3]Mohammed B. M. Kamel, Péter Ligeti, Adam Nagy:
Improved Approach of Address Propagation for F2F Networks. EECS 2018: 604-609 - 2017
- [i3]László Csirmaz, Péter Ligeti:
Secret sharing on large girth graphs. CoRR abs/1705.10520 (2017) - 2015
- [j6]László Csirmaz, Péter Ligeti, Gábor Tardos:
Erdős-Pyber Theorem for Hypergraphs and Secret Sharing. Graphs Comb. 31(5): 1335-1346 (2015) - 2013
- [i2]László Csirmaz, Péter Ligeti, Gábor Tardos:
Erdős-Pyber theorem for hypergraphs and secret sharing. CoRR abs/1311.5027 (2013) - 2012
- [j5]Mihály Bárász, Péter Ligeti, László Mérai, Daniel A. Nagy:
Anonymous sealed bid auction protocol based on a variant of the dining cryptographers' protocol. Period. Math. Hung. 65(2): 167-176 (2012)
2000 – 2009
- 2009
- [j4]László Csirmaz, Péter Ligeti:
On an infinite family of graphs with information ratio 2 - 1/k. Computing 85(1-2): 127-136 (2009) - [j3]Géza Kós, Péter Ligeti, Péter Sziklai:
Reconstruction of matrices from submatrices. Math. Comput. 78(267): 1733-1747 (2009) - 2008
- [j2]Szabolcs L. Fancsali, Péter Ligeti:
Some applications of finite geometry for secure network coding. J. Math. Cryptol. 2(3): 209-225 (2008) - 2007
- [c2]Mihály Bárász, Balázs Boros, Péter Ligeti, Krisztina Lója, Daniel A. Nagy:
Breaking EMAP. SecureComm 2007: 514-517 - 2006
- [c1]István Miklós, Timothy Brooks Paige, Péter Ligeti:
Efficient Sampling of Transpositions and Inverted Transpositions for Bayesian MCMC. WABI 2006: 174-185 - [i1]Péter L. Erdös, Péter Ligeti, Péter Sziklai, David C. Torney:
Subwords in reverse-complement order. Combinatorial and Algorithmic Foundations of Pattern and Association Discovery 2006 - 2005
- [j1]Péter Ligeti, Péter Sziklai:
Automorphisms of subword-posets. Discret. Math. 305(1-3): 372-378 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
