![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Hendrik Waldner
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j1]Christian Badertscher, Mahdi Sedaghat, Hendrik Waldner:
Unlinkable Policy-Compliant Signatures for Compliant and Decentralized Anonymous Payments. Proc. Priv. Enhancing Technol. 2024(4): 226-267 (2024) - [c11]Alexander R. Block, Zhiyong Fang, Jonathan Katz, Justin Thaler, Hendrik Waldner, Yupeng Zhang:
Field-Agnostic SNARKs from Expand-Accumulate Codes. CRYPTO (10) 2024: 276-307 - [c10]Christian Badertscher
, Monosij Maitra
, Christian Matt
, Hendrik Waldner
:
Updatable Policy-Compliant Signatures. Public Key Cryptography (1) 2024: 105-132 - [i13]Christian Badertscher, Monosij Maitra, Christian Matt, Hendrik Waldner:
Updatable Policy-Compliant Signatures. IACR Cryptol. ePrint Arch. 2024: 491 (2024) - 2023
- [c9]Michele Ciampi
, Rafail Ostrovsky
, Luisa Siniscalchi, Hendrik Waldner
:
List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing. CRYPTO (1) 2023: 459-488 - [c8]Atul Singh Arora, Andrea Coladangelo
, Matthew Coudron, Alexandru Gheorghiu, Uttam Singh, Hendrik Waldner:
Quantum Depth in the Random Oracle Model. STOC 2023: 1111-1124 - [i12]Christian Badertscher, Mahdi Sedaghat, Hendrik Waldner:
Fine-Grained Accountable Privacy via Unlinkable Policy-Compliant Signatures. IACR Cryptol. ePrint Arch. 2023: 1070 (2023) - [i11]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Hendrik Waldner:
List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing. IACR Cryptol. ePrint Arch. 2023: 1512 (2023) - [i10]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Hendrik Waldner:
Round-Optimal Black-Box Multiparty Computation from Polynomial-Time Assumptions. IACR Cryptol. ePrint Arch. 2023: 1742 (2023) - 2022
- [c7]Michele Ciampi
, Rafail Ostrovsky
, Hendrik Waldner
, Vassilis Zikas
:
Round-Optimal and Communication-Efficient Multiparty Computation. EUROCRYPT (1) 2022: 65-95 - [c6]Michele Ciampi
, Divya Ravi
, Luisa Siniscalchi, Hendrik Waldner
:
Round-Optimal Multi-party Computation with Identifiable Abort. EUROCRYPT (1) 2022: 335-364 - [i9]Atul Singh Arora, Andrea Coladangelo, Matthew Coudron, Alexandru Gheorghiu, Uttam Singh, Hendrik Waldner:
Quantum Depth in the Random Oracle Model. CoRR abs/2210.06454 (2022) - [i8]Michele Ciampi, Divya Ravi, Luisa Siniscalchi, Hendrik Waldner:
Round-Optimal Multi-Party Computation with Identifiable Abort. IACR Cryptol. ePrint Arch. 2022: 645 (2022) - 2021
- [c5]Christian Badertscher, Aggelos Kiayias, Markulf Kohlweiss
, Hendrik Waldner:
Consistency for Functional Encryption. CSF 2021: 1-16 - [c4]Michele Ciampi
, Luisa Siniscalchi
, Hendrik Waldner
:
Multi-Client Functional Encryption for Separable Functions. Public Key Cryptography (1) 2021: 724-753 - [c3]Christian Badertscher
, Christian Matt
, Hendrik Waldner
:
Policy-Compliant Signatures. TCC (3) 2021: 350-381 - [i7]Hendrik Waldner, Tilen Marc, Miha Stopar, Michel Abdalla:
Private Stream Aggregation from Labeled Secret Sharing Schemes. IACR Cryptol. ePrint Arch. 2021: 81 (2021) - [i6]Christian Badertscher, Christian Matt, Hendrik Waldner:
Policy-Compliant Signatures. IACR Cryptol. ePrint Arch. 2021: 1234 (2021) - 2020
- [c2]Michel Abdalla
, Florian Bourse, Hugo Marival, David Pointcheval
, Azam Soleimanian, Hendrik Waldner
:
Multi-Client Inner-Product Functional Encryption in the Random-Oracle Model. SCN 2020: 525-545 - [i5]Christian Badertscher, Aggelos Kiayias, Markulf Kohlweiss, Hendrik Waldner:
Consistency for Functional Encryption. IACR Cryptol. ePrint Arch. 2020: 137 (2020) - [i4]Michele Ciampi, Luisa Siniscalchi, Hendrik Waldner:
Multi-Client Functional Encryption for Separable Functions. IACR Cryptol. ePrint Arch. 2020: 219 (2020) - [i3]Michel Abdalla, Florian Bourse, Hugo Marival, David Pointcheval, Azam Soleimanian, Hendrik Waldner:
Multi-Client Inner-Product Functional Encryption in the Random-Oracle Model. IACR Cryptol. ePrint Arch. 2020: 788 (2020) - [i2]Michele Ciampi, Rafail Ostrovsky, Hendrik Waldner, Vassilis Zikas:
Round-Optimal and Communication-Efficient Multiparty Computation. IACR Cryptol. ePrint Arch. 2020: 1437 (2020)
2010 – 2019
- 2019
- [c1]Michel Abdalla
, Fabrice Benhamouda
, Markulf Kohlweiss
, Hendrik Waldner
:
Decentralizing Inner-Product Functional Encryption. Public Key Cryptography (2) 2019: 128-157 - [i1]Michel Abdalla, Fabrice Benhamouda, Markulf Kohlweiss, Hendrik Waldner:
Decentralizing Inner-Product Functional Encryption. IACR Cryptol. ePrint Arch. 2019: 20 (2019)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-20 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint