default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnselme Tueno
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j2]Anselme Tueno, Jonas Janneck, David Boehm:
A Method for Securely Comparing Integers using Binary Trees. Proc. Priv. Enhancing Technol. 2023(3): 469-487 (2023)- [i9]Jörn Kußmaul, Matthew Akram, Anselme Tueno:
Unbalanced Private Set Intersection from Homomorphic Encryption and Nested Cuckoo Hashing. IACR Cryptol. ePrint Arch. 2023: 1670 (2023) - 2022
- [c6]Anselme Tueno, David Boehm, Shin Ho Choe:
Integrating and Evaluating Quantum-safe TLS in Database Applications. DBSec 2022: 259-278 - [i8]Jonas Janneck, Anas Boudi, Anselme Tueno, Matthew Akram:
Secure Branching Program Evaluation. IACR Cryptol. ePrint Arch. 2022: 1075 (2022) - [i7]Jonas Janneck, Anselme Tueno, Jörn Kußmaul, Matthew Akram:
Private Computation On Set Intersection With Sublinear Communication. IACR Cryptol. ePrint Arch. 2022: 1137 (2022) - 2021
- [i6]Anselme Tueno, Jonas Janneck:
A Method for Securely Comparing Integers using Binary Trees. IACR Cryptol. ePrint Arch. 2021: 1646 (2021) - 2020
- [b1]Anselme Tueno:
Multiparty Protocols for Tree Classifiers. University of Passau, Germany, 2020 - [c5]Anselme Tueno, Florian Kerschbaum:
Efficient Secure Computation of Order-Preserving Encryption. AsiaCCS 2020: 193-207 - [c4]Anselme Tueno, Yordan Boev, Florian Kerschbaum:
Non-interactive Private Decision Tree Evaluation. DBSec 2020: 174-194 - [c3]Anselme Tueno, Florian Kerschbaum, Stefan Katzenbeisser, Yordan Boev, Mubashir Qureshi:
Secure Computation of the kth-Ranked Element in a Star Network. Financial Cryptography 2020: 386-403
2010 – 2019
- 2019
- [j1]Anselme Tueno, Florian Kerschbaum, Stefan Katzenbeisser:
Private Evaluation of Decision Trees using Sublinear Cost. Proc. Priv. Enhancing Technol. 2019(1): 266-286 (2019) - [c2]Florian Kerschbaum, Anselme Tueno:
An Efficiently Searchable Encrypted Data Structure for Range Queries. ESORICS (2) 2019: 344-364 - [i5]Anselme Tueno, Florian Kerschbaum, Stefan Katzenbeisser, Yordan Boev, Mubashir Qureshi:
Secure Computation of the kth-Ranked Element in a Star Network. CoRR abs/1909.08347 (2019) - [i4]Anselme Tueno, Yordan Boev, Florian Kerschbaum:
Non-Interactive Private Decision Tree Evaluation. CoRR abs/1909.08362 (2019) - 2018
- [i3]Anselme Tueno, Florian Kerschbaum:
Secure Range Queries for Multiple Users. CoRR abs/1802.01138 (2018) - 2017
- [c1]Anselme Tueno, Florian Kerschbaum, Daniel Bernau, Sara Foresti:
Selective access for supply chain management in the cloud. CNS 2017: 476-482 - [i2]Florian Kerschbaum, Anselme Tueno:
An Efficiently Searchable Encrypted Data Structure for Range Queries. CoRR abs/1709.09314 (2017) - 2012
- [i1]Anselme Tueno:
Zwei Anwendungen des Paillier-Kryptosystems: Blinde Signatur und Three-Pass-Protocol. CoRR abs/1206.1078 (2012)
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-04-25 05:53 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:
