default search action
Julia Kastner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [b1]Julia Kastner:
On Abstract Models in Cryptography and Their Applications. ETH Zurich, Zürich, Switzerland, 2024 - [c9]Julia Kastner
, Ky Nguyen
Pairing-Free Blind Signatures from Standard Assumptions in the ROM. CRYPTO (1) 2024: 210-245 - [c8]Dennis Hofheinz, Kristina Hostáková
Compact Selective Opening Security from LWE. Public Key Cryptography (4) 2024: 127-160 - 2023
- [c7]Julia Kastner
Concurrent Security of Anonymous Credentials Light, Revisited. CCS 2023: 45-59 - [c6]Dennis Hofheinz, Julia Kastner
The Power of Undirected Rewindings for Adaptive Security. CRYPTO (2) 2023: 725-758 - [i12]Samuel Bedassa Alemu, Julia Kastner:
On the Security of Blind Signatures in the Multi-Signer Setting. IACR Cryptol. ePrint Arch. 2023: 491 (2023) - [i11]Julia Kastner, Julian Loss, Omar Renawi:
Concurrent Security of Anonymous Credentials Light, Revisited. IACR Cryptol. ePrint Arch. 2023: 707 (2023) - [i10]Dennis Hofheinz, Kristina Hostáková, Julia Kastner, Karen Klein, Akin Ünal:
Compact Lossy Trapdoor Functions and Selective Opening Security From LWE. IACR Cryptol. ePrint Arch. 2023: 864 (2023) - [i9]Dennis Hofheinz, Julia Kastner, Akin Ünal, Bogdan Ursu:
Decoding LTFs in the Generic Group Model. IACR Cryptol. ePrint Arch. 2023: 866 (2023) - [i8]Dennis Hofheinz, Julia Kastner, Karen Klein:
The Power of Undirected Rewindings for Adaptive Security. IACR Cryptol. ePrint Arch. 2023: 875 (2023) - [i7]Julia Kastner, Ky Nguyen, Michael Reichle:
Pairing-Free Blind Signatures from Standard Assumptions in the ROM. IACR Cryptol. ePrint Arch. 2023: 1810 (2023) - 2022
- [c5]Julia Kastner
The Abe-Okamoto Partially Blind Signature Scheme Revisited. ASIACRYPT (4) 2022: 279-309 - [c4]Julia Kastner
On Pairing-Free Blind Signature Schemes in the Algebraic Group Model. Public Key Cryptography (2) 2022: 468-497 - [c3]Nicholas Brandt
The Price of Verifiability: Lower Bounds for Verifiable Random Functions. TCC (2) 2022: 747-776 - [i6]Nicholas Brandt, Dennis Hofheinz, Julia Kastner, Akin Ünal:
The Price of Verifiability: Lower Bounds for Verifiable Random Functions. IACR Cryptol. ePrint Arch. 2022: 762 (2022) - [i5]Julia Kastner, Julian Loss, Jiayu Xu:
The Abe-Okamoto Partially Blind Signature Scheme Revisited. IACR Cryptol. ePrint Arch. 2022: 1232 (2022) - 2020
- [c2]Thomas Agrikola
On Instantiating the Algebraic Group Model from Falsifiable Assumptions. EUROCRYPT (2) 2020: 96-126 - [i4]Thomas Agrikola, Dennis Hofheinz, Julia Kastner:
On Instantiating the Algebraic Group Model from Falsifiable Assumptions. IACR Cryptol. ePrint Arch. 2020: 70 (2020) - [i3]Julia Kastner, Julian Loss, Michael Rosenberg, Jiayu Xu:
On Pairing-Free Blind Signature Schemes in the Algebraic Group Model. IACR Cryptol. ePrint Arch. 2020: 1071 (2020)
2010 – 2019
- 2019
- [i2]Julia Kastner, Jiaxin Pan:
Towards Instantiating the Algebraic Group Model. IACR Cryptol. ePrint Arch. 2019: 1018 (2019) - 2017
- [c1]Julia Kastner
The Minimum Number of Cards in Practical Card-Based Protocols. ASIACRYPT (3) 2017: 126-155 - [i1]Julia Kastner, Alexander Koch, Stefan Walzer
The Minimum Number of Cards in Practical Card-based Protocols. IACR Cryptol. ePrint Arch. 2017: 863 (2017)
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-08-23 18:33 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: