Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleAugust 2024
Generic and Algebraic Computation Models: When AGM Proofs Transfer to the GGM
AbstractThe Fuchsbauer, Kiltz, and Loss (Crypto 2018) claim that (some) hardness results in the algebraic group model imply the same hardness results in the generic group model was recently called into question by Katz, Zhang, and Zhou (Asiacrypt 2022). ...
- ArticleJanuary 2024
Making an Asymmetric PAKE Quantum-Annoying by Hiding Group Elements
AbstractThe KHAPE-HMQV protocol is a state-of-the-art highly efficient asymmetric password-authenticated key exchange protocol that provides several desirable security properties, but has the drawback of being vulnerable to quantum adversaries due to its ...
- research-articleNovember 2022
FABEO: Fast Attribute-Based Encryption with Optimal Security
CCS '22: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications SecurityPages 2491–2504https://doi.org/10.1145/3548606.3560699Attribute-based encryption (ABE) enables fine-grained access control on encrypted data and has a large number of practical applications. This paper presents FABEO: faster pairing-based ciphertext-policy and key-policy ABE schemes that support expressive ...
- research-articleOctober 2017
Attribute-Based Encryption in the Generic Group Model: Automated Proofs and New Constructions
CCS '17: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications SecurityPages 647–664https://doi.org/10.1145/3133956.3134088Attribute-based encryption (ABE) is a cryptographic primitive which supports fine-grained access control on encrypted data, making it an appealing building block for many applications. In this paper, we propose, implement, and evaluate fully automated ...
- research-articleOctober 2017
Homomorphic encryption supporting logical operations
ICTCE '17: Proceedings of the 2017 International Conference on Telecommunications and Communication EngineeringPages 66–69https://doi.org/10.1145/3145777.3145789Homomorphic encryption is a form of encryption that allows computations to be carried out on ciphertext and generate an encrypted result which, when decrypted, matches the result of operations performed on the plaintexts. The feature of homomorphic ...
- research-articleNovember 2016
Strongly‐optimal structure preserving signatures from Type II pairings: synthesis and lower bounds
IET Information Security (ISE2), Volume 10, Issue 6Pages 358–371https://doi.org/10.1049/iet-ifs.2015.0429Recent work on structure‐preserving signatures (SPS) studies optimality of these schemes in terms of the number of group elements needed in the verification key and the signature, and the number of pairing‐product equations in the verification algorithm. ...
- ArticleDecember 2013
A Leakage-Resilient Pairing-Based Variant of the Schnorr Signature Scheme
IMACC 2013: Proceedings of the 14th IMA International Conference on Cryptography and Coding - Volume 8308Pages 173–192https://doi.org/10.1007/978-3-642-45239-0_11Leakage-resilient cryptography aims at capturing side-channel attacks within the provable security framework. Currently there exists a plethora of schemes with provably secure guarantees against a variety of side-channel attacks. However, meeting the ...
- ArticleOctober 2011
Optimal structure-preserving signatures
Structure preservation captures the notion of pairing-based schemes that rely on generic group operations and where the components are group elements. Their structural properties make it easy to compose them with other pairing-based schemes.
In this ...
- ArticleAugust 2011
Optimal structure-preserving signatures in asymmetric bilinear groups
Structure-preserving signatures are signatures defined over bilinear groups that rely on generic group operations. In particular, the messages and signatures consist of group elements and the verification of signatures consists of evaluating pairing ...
- ArticleOctober 2010
On the CCA1-security of Elgamal and Damgård's Elgamal
Inscrypt'10: Proceedings of the 6th international conference on Information security and cryptologyPages 18–35It is known that there exists a reduction from the CCA1- security of Damgård's Elgamal (DEG) cryptosystem to what we call the ddhdsdh assumption. We show that ddhdsdh is unnecessary for DEG- CCA1, while DDH is insufficient for DEG-CCA1. We also show ...
- ArticleFebruary 2010
Efficiency limitations for Σ-protocols for group homomorphisms
TCC'10: Proceedings of the 7th international conference on Theory of CryptographyPages 553–571https://doi.org/10.1007/978-3-642-11799-2_33Efficient zero-knowledge proofs of knowledge for group homomorphisms are essential for numerous systems in applied cryptography. Especially, Σ-protocols for proving knowledge of discrete logarithms in known and hidden order groups are of prime ...