Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleJuly 2024
Cryptographic Accumulators: New Definitions, Enhanced Security, and Delegatable Proofs
AbstractCryptographic accumulators, introduced in 1993 by Benaloh and De Mare, represent a set with a concise value and offer proofs of (non-)membership. Accumulators have evolved, becoming essential in anonymous credentials, e-cash, and blockchain ...
- ArticleMay 2024
A Public Key Identity-Based Revocation Scheme:: Fully Attribute-Hiding and Function Private
AbstractMulti-Recipient Encryption allows users to send secure messages to any chosen set of registered users. In ACISP’21, Blazy et al. proposed a multi-recipient encryption with attribute-hiding revocation where ciphertexts do not reveal any information ...
- ArticleOctober 2023
Dually Computable Cryptographic Accumulators and Their Application to Attribute Based Encryption
AbstractIn 1993, Benaloh and De Mare introduced cryptographic accumulator, a primitive that allows the representation of a set of values by a short object (the accumulator) and offers the possibility to prove that some input values are in the accumulator. ...
- research-articleAugust 2023
Efficient Implementation of a Post-Quantum Anonymous Credential Protocol
ARES '23: Proceedings of the 18th International Conference on Availability, Reliability and SecurityArticle No.: 24, Pages 1–11https://doi.org/10.1145/3600160.3600188Authentication on the Internet usually has the drawback of leaking the identity of the users, or at least allowing to trace them from a server to another. Anonymous credentials overcome this issue, by allowing users to reveal the attributes necessary ...
- research-articleAugust 2023
How fast do you heal?: a taxonomy for post-compromise security in secure-channel establishment
SEC '23: Proceedings of the 32nd USENIX Conference on Security SymposiumArticle No.: 331, Pages 5917–5934Post-Compromise Security (PCS) is a property of secure-channel establishment schemes, which limits the security breach of an adversary that has compromised one of the end-point to a certain number of messages, after which the channel heals. An attractive ...
-
- ArticleApril 2023
Post-quantum and UC-Secure Oblivious Transfer from SPHF with Grey Zone
AbstractOblivious Transfer (OT) is a major primitive for secure multi-party computation. Indeed, combined with symmetric primitives along with garbled circuits, it allows any secure function evaluation between two parties. In this paper, we propose a new ...
- research-articleDecember 2022
A gapless code-based hash proof system based on RQC and its applications
Designs, Codes and Cryptography (DCAC), Volume 90, Issue 12Pages 3011–3044https://doi.org/10.1007/s10623-022-01075-7AbstractCramer and Shoup introduced at Eurocrypt’02 the concept of hash proof system, also designated as smooth projective hash functions. Since then, they have found several applications, from building CCA-2 encryption as they were initially created for, ...
- ArticleNovember 2022
- research-articleSeptember 2022
Ouroboros: An Efficient and Provably Secure KEM Family
IEEE Transactions on Information Theory (ITHR), Volume 68, Issue 9Pages 6233–6244https://doi.org/10.1109/TIT.2022.3168439In this paper we introduce Ouroboros, a new family of Key Exchange protocols based on coding theory. The protocols propose a middle ground between the cryptosystems based on <inline-formula> <tex-math notation="LaTeX">$\mathsf {QC}$ </tex-math></inline-...
- ArticleJuly 2022
Identity-Based Encryption in DDH Hard Groups
AbstractThe concept of Identity-Based Encryption was first introduced by Shamir (CRYPTO 1984) but were not realised until much later by Sakai, Ohgishi and Kasahara (SCIS 2000), Boneh and Franklin (CRYPTO 2001) and Cocks (IMACC 2001). Since then, Identity-...
- research-articleMay 2022
MARSHAL: messaging with asynchronous ratchets and signatures for faster HeALing
SAC '22: Proceedings of the 37th ACM/SIGAPP Symposium on Applied ComputingPages 1666–1673https://doi.org/10.1145/3477314.3507044Secure messaging applications are deployed on devices that can be compromised, lost, stolen, or corrupted in many ways. Thus, recovering from attacks to get back to a clean state is essential and known as healing. Signal is a widely-known, privacy-...
- research-articleDecember 2021
Hardware security without secure hardware: How to decrypt with a password and a server
Theoretical Computer Science (TCSC), Volume 895, Issue CPages 178–211https://doi.org/10.1016/j.tcs.2021.09.042AbstractHardware security tokens have now been used for several decades to store cryptographic keys. When deployed, the security of the corresponding schemes fundamentally relies on the tamper-resistance of the tokens – a very strong ...
- ArticleDecember 2021
- ArticleOctober 2021
- research-articleAugust 2021
Secure Decision Forest Evaluation
ARES '21: Proceedings of the 16th International Conference on Availability, Reliability and SecurityArticle No.: 24, Pages 1–12https://doi.org/10.1145/3465481.3465763Decision forests are classical models to efficiently make decision on complex inputs with multiple features. While the global structure of the trees or forests is public, sensitive information have to be protected during the evaluation of some client ...
- research-articleJuly 2021
Zero-Knowledge Reparation of the Véron and AGS Code-based Identification Schemes
2021 IEEE International Symposium on Information Theory (ISIT)Pages 55–60https://doi.org/10.1109/ISIT45174.2021.9517937Designing code-based signatures is both an important and challenging problem. A standard way to tackle it consists to use the Fiat-Shamir heuristic along with an identification scheme that is required to be zero-knowledge. The authors of [1] have ...
- ArticleJune 2021
A Correction to a Code-Based Blind Signature Scheme
AbstractThis work proposes a reparation to the flaw in the paper of Blazy et al. (IEEE 2017). The flaw lies in the proof of the unforgeability property. More precisely, the way of handling collisions and of using the adversary to solve the challenge ...
- ArticleJune 2021
- ArticleMarch 2021
Generic Plaintext Equality and Inequality Proofs
AbstractGiven two ciphertexts generated with a public-key encryption scheme, the problem of plaintext equality consists in determining whether the ciphertexts hold the same value. Similarly, the problem of plaintext inequality consists in deciding whether ...
- ArticleDecember 2020
CCA-Secure ABE Using Tag and Pair Encoding
AbstractJutla and Roy (Asiacrypt 2013) proposed the first tag-based identity-based encryption which Chen and Gong (Asiacrypt 2017) extended to construct CPA-secure attribute-based encryption (ABE) in prime-order groups. However, Chen and Gong used ...