Olivier Blazy

Efficient Encryption From Random Quasi-Cyclic Codes

2018 · IEEE Transactions on Information Theory

We propose a framework for constructing efficient code-based encryption schemes that do not hide any structure in their public matrix. The framework is in the spirit of the schemes first proposed by Alekhnovich in 2003 …

MARSHAL

2022 · Proceedings of the 37th ACM/SIGAPP Symposium on Applied Computing

Secure 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. …

Post-Quantum Oblivious Transfer from Smooth Projective Hash Functions\n with Grey Zone

2022 · arXiv (Cornell University)

Oblivious Transfer (OT) is a major primitive for secure multiparty\ncomputation. Indeed, combined with symmetric primitives along with garbled\ncircuits, it allows any secure function evaluation between two parties. In this\npaper, we propose a new approach to …