default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDimitris Kolonelos
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Sanjam Garg, Dimitris Kolonelos, Guru-Vamsi Policharla, Mingyuan Wang:
Threshold Encryption with Silent Setup. CRYPTO (7) 2024: 352-386- [i11]Sanjam Garg
, Dimitris Kolonelos, Guru-Vamsi Policharla, Mingyuan Wang:
Threshold Encryption with Silent Setup. IACR Cryptol. ePrint Arch. 2024: 263 (2024) - 2023
- [j1]Daniel Benarroch, Matteo Campanelli, Dario Fiore, Kobi Gurkan, Dimitris Kolonelos:
Zero-knowledge proofs for set membership: efficient, succinct, modular. Des. Codes Cryptogr. 91(11): 3457-3525 (2023) - [c10]Dario Fiore, Dimitris Kolonelos, Paola de Perthuis:
Cuckoo Commitments: Registration-Based Encryption and Key-Value Map Commitments for Large Spaces. ASIACRYPT (5) 2023: 166-200 - [c9]Dimitris Kolonelos, Giulio Malavolta, Hoeteck Wee:
Distributed Broadcast Encryption from Bilinear Groups. ASIACRYPT (5) 2023: 407-441 - [c8]Noemi Glaeser, Dimitris Kolonelos, Giulio Malavolta, Ahmadreza Rahimi:
Efficient Registration-Based Encryption. CCS 2023: 1065-1079 - [c7]Nico Döttling, Dimitris Kolonelos, Russell W. F. Lai, Chuanwei Lin, Giulio Malavolta, Ahmadreza Rahimi:
Efficient Laconic Cryptography from Learning with Errors. EUROCRYPT (3) 2023: 417-446 - [c6]Dimitris Kolonelos, Mary Maller, Mikhail Volkhov:
Zero-Knowledge Arguments for Subverted RSA Groups. Public Key Cryptography (2) 2023: 512-541 - [i10]Dimitris Kolonelos, Mary Maller, Mikhail Volkhov:
Zero-Knowledge Arguments for Subverted RSA Groups. IACR Cryptol. ePrint Arch. 2023: 364 (2023) - [i9]Nico Döttling, Dimitris Kolonelos, Russell W. F. Lai, Chuanwei Lin, Giulio Malavolta, Ahmadreza Rahimi:
Efficient Laconic Cryptography from Learning With Errors. IACR Cryptol. ePrint Arch. 2023: 404 (2023) - [i8]Dimitris Kolonelos, Giulio Malavolta, Hoeteck Wee:
Distributed Broadcast Encryption from Bilinear Groups. IACR Cryptol. ePrint Arch. 2023: 874 (2023) - [i7]Dario Fiore, Dimitris Kolonelos, Paola de Perthuis:
Cuckoo Commitments: Registration-Based Encryption and Key-Value Map Commitments for Large Spaces. IACR Cryptol. ePrint Arch. 2023: 1389 (2023) - 2022
- [c5]Matteo Campanelli, Dario Fiore, Semin Han, Jihye Kim, Dimitris Kolonelos, Hyunok Oh:
Succinct Zero-Knowledge Batch Proofs for Set Accumulators. CCS 2022: 455-469 - [c4]Dario Fiore, Lydia Garms, Dimitris Kolonelos, Claudio Soriente, Ida Tucker:
Ring Signatures with User-Controlled Linkability. ESORICS (2) 2022: 405-426 - [c3]Hien Chu, Dario Fiore, Dimitris Kolonelos, Dominique Schröder:
Inner Product Functional Commitments with Constant-Size Public Parameters and Openings. SCN 2022: 639-662 - [i6]Hien Chu, Dario Fiore, Dimitris Kolonelos, Dominique Schröder:
Inner Product Functional Commitments with Constant-Size Public Parameters and Openings. IACR Cryptol. ePrint Arch. 2022: 524 (2022) - [i5]Noemi Glaeser, Dimitris Kolonelos, Giulio Malavolta, Ahmadreza Rahimi:
Efficient Registration-Based Encryption. IACR Cryptol. ePrint Arch. 2022: 1505 (2022) - [i4]Dario Fiore, Lydia Garms, Dimitris Kolonelos, Claudio Soriente, Ida Tucker:
Ring Signatures with User-Controlled Linkability. IACR Cryptol. ePrint Arch. 2022: 1743 (2022) - 2021
- [c2]Daniel Benarroch, Matteo Campanelli, Dario Fiore, Kobi Gurkan, Dimitris Kolonelos:
Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular. Financial Cryptography (1) 2021: 393-414 - [i3]Matteo Campanelli, Dario Fiore, Semin Han, Jihye Kim, Dimitris Kolonelos, Hyunok Oh:
Succinct Zero-Knowledge Batch Proofs for Set Accumulators. IACR Cryptol. ePrint Arch. 2021: 1672 (2021) - 2020
- [c1]Matteo Campanelli, Dario Fiore, Nicola Greco, Dimitris Kolonelos, Luca Nizzardo:
Incrementally Aggregatable Vector Commitments and Applications to Verifiable Decentralized Storage. ASIACRYPT (2) 2020: 3-35 - [i2]Matteo Campanelli, Dario Fiore, Nicola Greco, Dimitris Kolonelos, Luca Nizzardo:
Vector Commitment Techniques and Applications to Verifiable Decentralized Storage. IACR Cryptol. ePrint Arch. 2020: 149 (2020)
2010 – 2019
- 2019
- [i1]Daniel Benarroch, Matteo Campanelli, Dario Fiore, Dimitris Kolonelos:
Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular. IACR Cryptol. ePrint Arch. 2019: 1255 (2019)
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-10-07 22:09 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:
