default search action
Benedikt Schmidt
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. The links to all actual bibliographies of persons of the same or a similar name can be found below. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Other persons with the same name
- Benedikt Schmidt 0001 — Darmstadt University of Technology, Germany
- Benedikt Schmidt 0002 — ETH Zurich, Zürich, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j5]Nika Strem
, Devendra Singh Dhami, Benedikt Schmidt, Benjamin Klöpper, Kristian Kersting
APT: Alarm Prediction Transformer. Expert Syst. Appl. 261: 125521 (2025) - 2023
- [j4]Georg Starke
Explainability as fig leaf? An exploration of experts' ethical expectations towards machine learning in psychiatry. AI Ethics 3(1): 303-314 (2023) - 2022
- [j3]Ingo Sawilla, Christian Weber, Benedikt Schmidt, Marco Ulrich:
Industrial challenges for AI systems engineering. Autom. 70(9): 805-814 (2022) - 2021
- [c16]Marco Gärtler, Benedikt Schmidt:
Practical Challenges of Virtual Assistants and Voice Interfaces in Industrial Applications. HICSS 2021: 1-10 - [c15]Hareesh Konanki, Alexander Elbel, Benedikt Schmidt, Sairam Nandyala, Alfons Noe, Dominik Aufderheide
Model-based Control of a Gravimetric Dosing Conveyor for Alternative Fuels in the Cement Industry. ICSET 2021: 153-158 - [c14]Benedikt Schmidt, Reuben Borrison, Marco Gärtler
Practical Aspects for Exploration and Analysis of Manual Interventions in Process Plants. INDIN 2021: 1-6
2010 – 2019
- 2019
- [j2]Gilles Barthe, Edvard Fagerholm, Dario Fiore, John C. Mitchell
Automated Analysis of Cryptographic Assumptions in Generic Group Models. J. Cryptol. 32(2): 324-360 (2019) - 2018
- [c13]Benedikt Schmidt, Reuben Borrison, Andrew Cohen, Marcel Dix, Marco Gärtler
Industrial Virtual Assistants: Challenges and Opportunities. UbiComp/ISWC Adjunct 2018: 794-801 - 2017
- [c12]José Bacelar Almeida
Jasmin: High-Assurance and High-Speed Cryptography. CCS 2017: 1807-1823 - [c11]Miguel Ambrona
Generic Transformations of Predicate Encodings: Constructions and Applications. CRYPTO (1) 2017: 36-66 - [c10]Véronique Cortier, Constantin Catalin Dragan
Machine-Checked Proofs of Privacy for Electronic Voting Protocols. IEEE Symposium on Security and Privacy 2017: 993-1008 - 2016
- [j1]Gilles Barthe
Strongly-optimal structure preserving signatures from Type II pairings: synthesis and lower bounds. IET Inf. Secur. 10(6): 358-371 (2016) - [c9]Miguel Ambrona
Automated Unbounded Analysis of Cryptographic Constructions in the Generic Group Model. EUROCRYPT (2) 2016: 822-851 - [c8]Marc Fischlin, Felix Günther, Benedikt Schmidt, Bogdan Warinschi:
Key Confirmation in Key Exchange: A Formal Treatment and Implications for TLS 1.3. IEEE Symposium on Security and Privacy 2016: 452-469 - [i6]Miguel Ambrona, Gilles Barthe, Benedikt Schmidt:
Automated Unbounded Analysis of Cryptographic Constructions in the Generic Group Model. IACR Cryptol. ePrint Arch. 2016: 270 (2016) - [i5]Miguel Ambrona, Gilles Barthe, Benedikt Schmidt:
Generic Transformations of Predicate Encodings: Constructions and Applications. IACR Cryptol. ePrint Arch. 2016: 1105 (2016) - 2015
- [c7]Gilles Barthe
Automated Proofs of Pairing-Based Cryptography. CCS 2015: 1156-1168 - [c6]Gilles Barthe, Juan Manuel Crespo, Yassine Lakhnech, Benedikt Schmidt:
Mind the Gap: Modular Machine-Checked Proofs of One-Round Key Exchange Protocols. EUROCRYPT (2) 2015: 689-718 - [c5]Gilles Barthe, Edvard Fagerholm, Dario Fiore, Andre Scedrov
Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds. Public Key Cryptography 2015: 355-376 - [i4]Gilles Barthe, Edvard Fagerholm, Dario Fiore, Andre Scedrov, Benedikt Schmidt, Mehdi Tibouchi:
Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds. IACR Cryptol. ePrint Arch. 2015: 19 (2015) - [i3]Gilles Barthe, Juan Manuel Crespo, Yassine Lakhnech, Benedikt Schmidt:
Mind the Gap: Modular Machine-checked Proofs of One-Round Key Exchange Protocols. IACR Cryptol. ePrint Arch. 2015: 74 (2015) - 2014
- [c4]Gilles Barthe, Edvard Fagerholm, Dario Fiore, John C. Mitchell, Andre Scedrov
Automated Analysis of Cryptographic Assumptions in Generic Group Models. CRYPTO (1) 2014: 95-112 - [c3]Joseph A. Akinyele, Gilles Barthe
Certified Synthesis of Efficient Batch Verifiers. CSF 2014: 153-165 - [i2]Gilles Barthe, Edvard Fagerholm, Dario Fiore, John C. Mitchell, Andre Scedrov, Benedikt Schmidt:
Automated Analysis of Cryptographic Assumptions in Generic Group Models. IACR Cryptol. ePrint Arch. 2014: 458 (2014) - 2013
- [c2]Gilles Barthe
Fully automated analysis of padding-based encryption in the computational model. CCS 2013: 1247-1260 - [c1]Gilles Barthe, François Dupressoir
EasyCrypt: A Tutorial. FOSAD 2013: 146-166 - [i1]Oliver Obst, Joschka Boedecker, Benedikt Schmidt, Minoru Asada:
On active information storage in input-driven systems. CoRR abs/1303.5526 (2013)
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-11-07 21:32 CET 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: