Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJuly 2024
Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes
AbstractChameleon-hash functions, introduced by Krawczyk and Rabin (NDSS’00), are trapdoor collision-resistant hash functions parametrized by a public key. If the corresponding secret key is known, arbitrary collisions for the hash function can be found ...
- research-articleApril 2021
Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange
AbstractForward secrecy is considered an essential design goal of modern key establishment (KE) protocols, such as TLS 1.3, for example. Furthermore, efficiency considerations such as zero round-trip time (0-RTT), where a client is able to send ...
- ArticleMarch 2021
Fine-Grained Forward Secrecy: Allow-List/Deny-List Encryption and Applications
AbstractForward secrecy is an important feature for modern cryptographic systems and is widely used in secure messaging such as Signal and WhatsApp as well as in common Internet protocols such as TLS, IPSec, or SSH. The benefit of forward secrecy is that ...
- ArticleSeptember 2020
Fully Collision-Resistant Chameleon-Hashes from Simpler and Post-quantum Assumptions
AbstractChameleon-hashes are collision-resistant hash-functions parametrized by a public key. If the corresponding secret key is known, arbitrary collisions for the hash can be found. Recently, Derler et al. (PKC ’20) introduced the notion of fully ...
- ArticleMay 2020
Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes
AbstractChameleon-hash functions, introduced by Krawczyk and Rabin at NDSS 2000, are trapdoor collision-resistant hash-functions parametrized by a public key. If the corresponding secret key is known, arbitrary collisions for the hash function can be ...
- articleJune 2019
Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
Designs, Codes and Cryptography (DCAC), Volume 87, Issue 6Pages 1373–1413https://doi.org/10.1007/s10623-018-0535-9Key-homomorphic properties of cryptographic objects, i.e., homomorphisms on their key space, have proven to be useful, both from a theoretical as well as a practical perspective. Important cryptographic objects such as pseudorandom functions or (public ...
- articleNovember 2018
Practical witness encryption for algebraic languages or how to encrypt under Groth---Sahai proofs
Designs, Codes and Cryptography (DCAC), Volume 86, Issue 11Pages 2525–2547https://doi.org/10.1007/s10623-018-0460-yWitness encryption ($$\mathsf{WE}$$WE) is a recent powerful encryption paradigm, which allows to encrypt a message using the description of a hard problem (a word in an $${\mathbf{NP}}$$NP-language) and someone who knows a solution to this problem (a ...
- research-articleMay 2018
Highly-Efficient Fully-Anonymous Dynamic Group Signatures
ASIACCS '18: Proceedings of the 2018 on Asia Conference on Computer and Communications SecurityPages 551–565https://doi.org/10.1145/3196494.3196507Group signatures are a central tool in privacy-enhancing cryptography, which allow members of a group to anonymously produce signatures on behalf of the group. Consequently, they are an attractive means to implement privacy-friendly authentication ...
- research-articleOctober 2017
Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives
- Melissa Chase,
- David Derler,
- Steven Goldfeder,
- Claudio Orlandi,
- Sebastian Ramacher,
- Christian Rechberger,
- Daniel Slamanig,
- Greg Zaverucha
CCS '17: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications SecurityPages 1825–1842https://doi.org/10.1145/3133956.3133997We propose a new class of post-quantum digital signature schemes that: (a) derive their security entirely from the security of symmetric-key primitives, believed to be quantum-secure, and (b) have extremely small keypairs, and, (c) are highly ...
- ArticleApril 2023
Homomorphic Proxy Re-Authenticators and Applications to Verifiable Multi-User Data Aggregation
AbstractWe introduce the notion of homomorphic proxy re-authenticators, a tool that adds security and verifiability guarantees to multi-user data aggregation scenarios. It allows distinct sources to authenticate their data under their own keys, and a ...
- ArticleMarch 2017
Chameleon-Hashes with Ephemeral Trapdoors
Proceedings, Part II, of the 20th IACR International Conference on Public-Key Cryptography --- PKC 2017 - Volume 10175Pages 152–182https://doi.org/10.1007/978-3-662-54388-7_6A chameleon-hash function is a hash function that involves a trapdoor the knowledge of which allows one to find arbitrary collisions in the domain of the function. In this paper, we introduce the notion of chameleon-hash functions with ephemeral ...
- ArticleNovember 2016
Signer-Anonymous Designated-Verifier Redactable Signatures for Cloud-Based Data Sharing
AbstractRedactable signature schemes allow to black out predefined parts of a signed message without affecting the validity of the signature, and are therefore an important building block in privacy-enhancing cryptography. However, a second look shows, ...
- ArticleFebruary 2016
Non-Interactive Plaintext In-Equality Proofs and Group Signatures with Verifiable Controllable Linkability
Proceedings of the RSA Conference on Topics in Cryptology - CT-RSA 2016 - Volume 9610Pages 127–143https://doi.org/10.1007/978-3-319-29485-8_8Group signatures are an important privacy-enhancing tool that allow to anonymously sign messages on behalf of a group. A recent feature for group signatures is controllable linkability, where a dedicated linking authority LA can determine whether two ...
- ArticleDecember 2015
A New Approach to Efficient Revocable Attribute-Based Anonymous Credentials
IMACC 2015: Proceedings of the 15th IMA International Conference on Cryptography and Coding - Volume 9496Pages 57–74https://doi.org/10.1007/978-3-319-27239-9_4Recently, a new paradigm to construct very efficient multi-show attribute-based anonymous credential ABC systems has been introduced in Asiacrypt'14. Here, structure-preserving signatures on equivalence classes SPS-EQ-$$\mathcal {R}$$, a novel flavor of ...
- ArticleNovember 2015
Rethinking Privacy for Extended Sanitizable Signatures and a Black-Box Construction of Strongly Private Schemes
ProvSec 2015: Proceedings of the 9th International Conference on Provable Security - Volume 9451Pages 455–474https://doi.org/10.1007/978-3-319-26059-4_25Sanitizable signatures, introduced by Ateniese et al. at ESORICS'05, allow to issue a signature on a message where certain predefined message blocks may later be changed sanitized by some dedicated party the sanitizer without invalidating the original ...
- ArticleJuly 2014
Privacy-Enhancing Proxy Signatures from Non-interactive Anonymous Credentials
DBSec 2014: Proceedings of the 28th Annual IFIP WG 11.3 Working Conference on Data and Applications Security and Privacy XXVIII - Volume 8566Pages 49–65https://doi.org/10.1007/978-3-662-43936-4_4Proxy signatures enable an originator to delegate the signing rights for a restricted set of messages to a proxy. The proxy is then able to produce valid signatures only for messages from this delegated set on behalf of the originator. Recently, two ...
- ArticleNovember 2011
Anonymous ticketing for NFC-Enabled mobile phones
INTRUST'11: Proceedings of the Third international conference on Trusted SystemsPages 66–83https://doi.org/10.1007/978-3-642-32298-3_5Modern smart-phones are equipped with various interfaces such as NFC, allowing a versatile use of the device for many different applications. However, every transaction of the phone especially via its NFC interface can be recorded and stored for further ...