default search action
Ágnes Kiss
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c11]Cristian-Alexandru Staicu, Sazzadur Rahaman, Ágnes Kiss, Michael Backes:
Bilingual Problems: Studying the Security Risks Incurred by Native Extensions in Scripting Languages. USENIX Security Symposium 2023: 6133-6150 - 2021
- [b1]Ágnes Kiss:
Efficient Private Function Evaluation. Technical University of Darmstadt, Germany, 2021 - [i12]Cristian-Alexandru Staicu, Sazzadur Rahaman, Ágnes Kiss, Michael Backes:
Bilingual Problems: Studying the Security Risks Incurred by Native Extensions in Scripting Languages. CoRR abs/2111.11169 (2021) - 2020
- [j4]Kimmo Järvinen, Ágnes Kiss, Thomas Schneider
, Oleksandr Tkachenko, Zheng Yang
Faster privacy-preserving location proximity schemes for circles and polygons. IET Inf. Secur. 14(3): 254-265 (2020) - [j3]Masaud Y. Alhassan, Daniel Günther
Efficient and Scalable Universal Circuits. J. Cryptol. 33(3): 1216-1271 (2020) - [c10]Johannes Buchmann, Ghada Dessouky, Tommaso Frassetto, Ágnes Kiss, Ahmad-Reza Sadeghi, Thomas Schneider
SAFE: A Secure and Efficient Long-Term Distributed Storage System. SBC@AsiaCCS 2020: 8-13 - [c9]Marco Holz, Ágnes Kiss, Deevashwer Rathee, Thomas Schneider
Linear-Complexity Private Function Evaluation is Practical. ESORICS (2) 2020: 401-420 - [i11]Rosario Cammarota, Matthias Schunter, Anand Rajan, Fabian Boemer, Ágnes Kiss, Amos Treiber, Christian Weinert, Thomas Schneider, Emmanuel Stapf, Ahmad-Reza Sadeghi, Daniel Demmler
Trustworthy AI Inference Systems: An Industry Research View. CoRR abs/2008.04449 (2020) - [i10]Johannes Buchmann, Ghada Dessouky, Tommaso Frassetto, Ágnes Kiss, Ahmad-Reza Sadeghi, Thomas Schneider, Giulia Traverso, Shaza Zeitouni:
SAFE: A Secure and Efficient Long-Term Distributed Storage System. IACR Cryptol. ePrint Arch. 2020: 690 (2020) - [i9]Marco Holz, Ágnes Kiss, Deevashwer Rathee, Thomas Schneider:
Linear-Complexity Private Function Evaluation is Practical. IACR Cryptol. ePrint Arch. 2020: 853 (2020)
2010 – 2019
- 2019
- [j2]Ágnes Kiss, Masoud Naderpour, Jian Liu, N. Asokan
SoK: Modular and Efficient Private Decision Tree Evaluation. Proc. Priv. Enhancing Technol. 2019(2): 187-208 (2019) - [c8]Susanne Felsen, Ágnes Kiss, Thomas Schneider
Secure and Private Function Evaluation with Intel SGX. CCSW 2019: 165-181 - [c7]Daniel Günther
Poster: Framework for Semi-Private Function Evaluation with Application to Secure Insurance Rate Calculation. CCS 2019: 2541-2543 - [c6]Ágnes Kiss, Oliver Schick, Thomas Schneider
Web Application for Privacy-preserving Scheduling using Secure Computation. ICETE (2) 2019: 456-463 - [i8]Masaud Y. Alhassan, Daniel Günther, Ágnes Kiss, Thomas Schneider:
Efficient and Scalable Universal Circuits. IACR Cryptol. ePrint Arch. 2019: 348 (2019) - 2018
- [c5]Kimmo Järvinen, Ágnes Kiss, Thomas Schneider, Oleksandr Tkachenko
Faster Privacy-Preserving Location Proximity Schemes. CANS 2018: 3-22 - [i7]Kimmo Järvinen, Ágnes Kiss, Thomas Schneider, Oleksandr Tkachenko, Zheng Yang:
Faster Privacy-Preserving Location Proximity Schemes. IACR Cryptol. ePrint Arch. 2018: 694 (2018) - [i6]Ágnes Kiss, Masoud Naderpour, Jian Liu, N. Asokan, Thomas Schneider:
SoK: Modular and Efficient Private Decision Tree Evaluation. IACR Cryptol. ePrint Arch. 2018: 1099 (2018) - 2017
- [j1]Ágnes Kiss, Jian Liu, Thomas Schneider
Private Set Intersection for Unequal Set Sizes with Mobile Applications. Proc. Priv. Enhancing Technol. 2017(4): 177-197 (2017) - [c4]Daniel Günther
More Efficient Universal Circuit Constructions. ASIACRYPT (2) 2017: 443-470 - [i5]Ágnes Kiss, Jian Liu, Thomas Schneider, N. Asokan, Benny Pinkas:
Private Set Intersection for Unequal Set Sizes with Mobile Applications. IACR Cryptol. ePrint Arch. 2017: 670 (2017) - [i4]Daniel Günther, Ágnes Kiss, Thomas Schneider:
More Efficient Universal Circuit Constructions. IACR Cryptol. ePrint Arch. 2017: 798 (2017) - 2016
- [c3]Ágnes Kiss, Juliane Krämer, Pablo Rauzy
Algorithmic Countermeasures Against Fault Attacks and Power Analysis for RSA-CRT. COSADE 2016: 111-129 - [c2]Ágnes Kiss, Thomas Schneider
Valiant's Universal Circuit is Practical. EUROCRYPT (1) 2016: 699-728 - [i3]Ágnes Kiss, Thomas Schneider:
Valiant's Universal Circuit is Practical. IACR Cryptol. ePrint Arch. 2016: 93 (2016) - [i2]Ágnes Kiss, Juliane Krämer, Pablo Rauzy, Jean-Pierre Seifert:
Algorithmic Countermeasures Against Fault Attacks and Power Analysis for RSA-CRT. IACR Cryptol. ePrint Arch. 2016: 238 (2016) - 2015
- [c1]Ágnes Kiss, Juliane Krämer, Anke Stüber:
On the Optimality of Differential Fault Analyses on CLEFIA. MACIS 2015: 181-196 - 2014
- [i1]Juliane Krämer, Anke Stüber, Ágnes Kiss:
On the Optimality of Differential Fault Analyses on CLEFIA. IACR Cryptol. ePrint Arch. 2014: 572 (2014)
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:10 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: