Unit
Security and Cryptography Laboratory
LaboratoryRelated publications (856)
Secure and Efficient Cryptographic Algorithms in a Quantum World
Since the advent of internet and mass communication, two public-key cryptographic algorithms have shared the monopoly of data encryption and authentication: Diffie-Hellman and RSA. However, in the last few years, progress made in quantum physics -- and mor ...
EPFL2024On the Theory and Practice of Modern Secure Messaging
Billions of people now have conversations daily over the Internet. A large portion of this communication takes place via secure messaging protocols that offer "end-to-end encryption'" guarantees and resilience to compromise like the widely-used Double Ratc ...
EPFL2024Side-channel analysis of isogeny-based key encapsulation mechanisms and hash-based digital signatures
Current cryptographic solutions will become obsolete with the arrival of large-scale universal quantum computers. As a result, the National Institute of Standards and Technology supervises a post-quantum standardization process which involves evaluating ca ...
EPFL2024Differentially private multi-agent constraint optimization
Boi Faltings, Sujit Prakash Gujar, Aleksei Triastcyn, Sankarshan Damle
Distributed constraint optimization (DCOP) is a framework in which multiple agents with private constraints (or preferences) cooperate to achieve a common goal optimally. DCOPs are applicable in several multi-agent coordination/allocation problems, such as ...
Dordrecht2024When Your AI Becomes a Target: AI Security Incidents and Best Practices
Alexandre Massoud Alahi, Kathrin Grosse
In contrast to vast academic efforts to study AI security, few real-world reports of AI security incidents exist. Released incidents prevent a thorough investigation of the attackers' motives, as crucial information about the company and AI application is ...
AAAI Press2024An Ultra-High Throughput AES-Based Authenticated Encryption Scheme for 6G: Design and Implementation
Andrea Felice Caforio, Subhadeep Banik
In this paper, we propose Rocca-S, an authenticated encryption scheme with a 256-bit key and a 256-bit tag targeting 6G applications bootstrapped from AES. Rocca-S achieves an encryption/decryption speed of more than 200 Gbps in the latest software environ ...
Springer International Publishing Ag2024Isogeny Problems with Level Structure
Given two elliptic curves and the degree of an isogeny between them, finding the isogeny is believed to be a difficult problem—upon which rests the security of nearly any isogeny-based scheme. If, however, to the data above we add information about the beh ...
2024Exploring SIDH-Based Signature Parameters
Tako Boris Fouotsa, Laurane Chloé Angélina Marco, Andrea Basso
Isogeny-based cryptography is an instance of post-quantum cryptography whose fundamental problem consists of finding an isogeny between two (isogenous) elliptic curves E and E′. This problem is closely related to that of computing the endomorphism ring of ...
Springer2024PRO-Face C: Privacy-Preserving Recognition of Obfuscated Face via Feature Compensation
Touradj Ebrahimi, Lin Yuan, Xiao Pu, Yao Zhang, Hongbo Li
The advancement of face recognition technology has delivered substantial societal advantages. However, it has also raised global privacy concerns due to the ubiquitous collection and potential misuse of individuals' facial data. This presents a notable par ...
Ieee-Inst Electrical Electronics Engineers Inc2024Breaking Blockchain Rationality with Out-of-Band Collusion
Bryan Alexander Ford, Verónica del Carmen Estrada Galiñanes, Louis-Henri Manuel Jakob Merino, Haoqian Zhang, Mahsa Bastankhah
Blockchain systems often rely on rationality assumptions for their security, expecting that nodes are motivated to maximize their profits. These systems thus design their protocols to incentivize nodes to execute the honest protocol but fail to consider ou ...
Cham2024