default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDF. Betül Durak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i15]F. Betül Durak, Kim Laine, Simon Langowski, Radames Cruz Moreno:
Sandi: A System for Accountability and Applications in Direct Communication. CoRR abs/2401.16759 (2024)- [i14]F. Betül Durak, Laurane Marco, Abdullah Talayhan, Serge Vaudenay:
Non-Transferable Anonymous Tokens by Secret Binding. IACR Cryptol. ePrint Arch. 2024: 711 (2024) - 2023
- [c14]Melissa Chase, F. Betül Durak, Serge Vaudenay:
Anonymous Tokens with Stronger Metadata Bit Hiding from Algebraic MACs. CRYPTO (2) 2023: 418-449 - [i13]F. Betül Durak, Kim Laine, Simon Langowski, Radames Cruz Moreno, Robert Sim, Shrey Jain:
Sandi: A System for Accountability and Applications in Direct Communication (Extended Abstract). CoRR abs/2311.04861 (2023) - 2022
- [i12]F. Betül Durak, Serge Vaudenay, Melissa Chase:
Anonymous Tokens with Hidden Metadata Bit from Algebraic MACs. IACR Cryptol. ePrint Arch. 2022: 1622 (2022) - 2021
- [c13]F. Betül Durak, Henning Horst, Michael Horst, Serge Vaudenay:
FAST: Secure and High Performance Format-Preserving Encryption and Tokenization. ASIACRYPT (3) 2021: 465-489 - [c12]Gwangbae Choi, F. Betül Durak, Serge Vaudenay:
Post-Compromise Security in Self-Encryption. ITC 2021: 25:1-25:23 - [c11]F. Betül Durak, Jorge Guajardo:
Improving the Efficiency of AES Protocols in Multi-Party Computation. Financial Cryptography (1) 2021: 229-248 - [c10]Andrea Caforio, F. Betül Durak, Serge Vaudenay:
Beyond Security and Efficiency: On-Demand Ratcheting with Security Awareness. Public Key Cryptography (2) 2021: 649-677 - [i11]F. Betül Durak, Henning Horst, Michael Horst, Serge Vaudenay:
FAST: Secure and High Performance Format-Preserving Encryption and Tokenization. IACR Cryptol. ePrint Arch. 2021: 1171 (2021) - [i10]Erik Anderson, Melissa Chase, F. Betül Durak, Esha Ghosh, Kim Laine, Chenkai Weng:
Aggregate Measurement via Oblivious Shuffling. IACR Cryptol. ePrint Arch. 2021: 1490 (2021) - 2020
- [j2]Subhadeep Banik
, Khashayar Barooti, F. Betül Durak, Serge Vaudenay:
Cryptanalysis of LowMC instances using single plaintext/ciphertext pair. IACR Trans. Symmetric Cryptol. 2020(4): 130-146 (2020) - [c9]F. Betül Durak, Loïs Huguenin-Dumittan, Serge Vaudenay:
\(\mathsf {BioLocker}\): A Practical Biometric Authentication Mechanism Based on 3D Fingervein. ACNS (2) 2020: 62-80 - [i9]F. Betül Durak, Loïs Huguenin-Dumittan, Serge Vaudenay:
BioLocker: A Practical Biometric Authentication Mechanism based on 3D Fingervein. IACR Cryptol. ePrint Arch. 2020: 453 (2020)
2010 – 2019
- 2019
- [j1]Thang Hoang, Attila A. Yavuz, F. Betül Durak, Jorge Guajardo:
A multi-server oblivious dynamic searchable encryption framework. J. Comput. Secur. 27(6): 649-676 (2019) - [c8]Ciprian Baetu, F. Betül Durak, Loïs Huguenin-Dumittan, Abdullah Talayhan, Serge Vaudenay:
Misuse Attacks on Post-quantum Cryptosystems. EUROCRYPT (2) 2019: 747-776 - [c7]F. Betül Durak, Serge Vaudenay:
Bidirectional Asynchronous Ratcheted Key Agreement with Linear Complexity. IWSEC 2019: 343-362 - [c6]Fatih Balli, F. Betül Durak, Serge Vaudenay:
BioID: A Privacy-Friendly Identity Document. STM 2019: 53-70 - [i8]Ciprian Baetu, F. Betül Durak, Loïs Huguenin-Dumittan, Abdullah Talayhan, Serge Vaudenay:
Misuse Attacks on Post-Quantum Cryptosystems. IACR Cryptol. ePrint Arch. 2019: 525 (2019) - [i7]Fatih Balli, F. Betül Durak, Serge Vaudenay:
BioID: a Privacy-Friendly Identity Document. IACR Cryptol. ePrint Arch. 2019: 894 (2019) - [i6]Andrea Caforio, F. Betül Durak, Serge Vaudenay:
On-Demand Ratcheting with Security Awareness. IACR Cryptol. ePrint Arch. 2019: 965 (2019) - 2018
- [c5]F. Betül Durak, Serge Vaudenay:
Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains. ACNS 2018: 440-458 - [c4]Thang Hoang, Attila A. Yavuz, F. Betül Durak, Jorge Guajardo:
Oblivious Dynamic Searchable Encryption on Distributed Cloud Systems. DBSec 2018: 113-130 - [i5]F. Betül Durak, Serge Vaudenay:
Generic Round-Function Recovery for Feistel Networks over Small Domains. IACR Cryptol. ePrint Arch. 2018: 108 (2018) - [i4]F. Betül Durak, Serge Vaudenay:
Bidirectional Asynchronous Ratcheted Key Agreement without Key-Update Primitives. IACR Cryptol. ePrint Arch. 2018: 889 (2018) - 2017
- [c3]F. Betül Durak, Serge Vaudenay:
Breaking the FF3 Format-Preserving Encryption Standard over Small Domains. CRYPTO (2) 2017: 679-707 - [i3]F. Betül Durak, Serge Vaudenay:
Breaking the FF3 Format-Preserving Encryption Standard Over Small Domains. IACR Cryptol. ePrint Arch. 2017: 521 (2017) - [i2]Thang Hoang, Attila A. Yavuz, F. Betül Durak, Jorge Guajardo:
Oblivious Dynamic Searchable Encryption via Distributed PIR and ORAM. IACR Cryptol. ePrint Arch. 2017: 1158 (2017) - 2016
- [c2]F. Betül Durak, Thomas M. DuBuisson, David Cash:
What Else is Revealed by Order-Revealing Encryption? CCS 2016: 1155-1166 - [c1]F. Betül Durak, Serge Vaudenay:
Circular Security Reconsidered. SECITC 2016: 3-19 - [i1]F. Betül Durak, Thomas DuBuisson, David Cash:
What Else is Revealed by Order-Revealing Encryption? IACR Cryptol. ePrint Arch. 2016: 786 (2016)
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-31 02:28 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:
