Multiquadratic Rings and Walsh-Hadamard Transforms for Oblivious Linear Function Evaluation

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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 mo ...

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

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

Let X be a complex projective K3 surface and let T-X be its transcendental lattice; the characteristic polynomials of isometries of T-X induced by automorphisms of X are powers of cyclotomic polynomials. Which powers of cyclotomic polynomials occur? The ai ...

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

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

With the looming threat of large-scale quantum computers, a fair portion of recent cryptographic research has focused on examining cryptographic primitives from the perspective of a quantum adversary. Shor's 1994 result revealed that quantum computers can ...

Witness encryption is a cryptographic primitive which encrypts a message under an instance of an NP language and decrypts the ciphertext using a witness associated with that instance. In the current state of the art, most of the witness encryption construc ...

In the framework of Impagliazzo's five worlds, a distinction is often made between two worlds, one where public-key encryption exists (Cryptomania), and one in which only one-way functions exist (MiniCrypt). However, the boundaries between these worlds can ...

Many real-world group messaging systems delegate group administration to the application level, failing to provide formal guarantees related to group membership. Taking a cryptographic approach to group administration can prevent both implementation and pr ...

With the pervasive digitalization of modern life, we benefit from efficient access to information and services. Yet, this digitalization poses severe privacy challenges, especially for special-needs individuals. Beyond being a fundamental human right, priv ...

Homomorphic Encryption (HE) enables computations to be executed directly on encrypted data. As such, it is an auspicious solution for protecting the confidentiality of sensitive data without impeding its usability. However, HE does not provide any guarant ...

Commitment is a key primitive which resides at the heart of several cryptographic protocols. Noisy channels can help realize information-theoretically secure commitment schemes; however, their imprecise statistical characterization can severely impair such ...

To answer the growing demand for hardware acceleration, Amazon, Microsoft, and many other major cloud service providers have included field-programmable gate arrays (FPGAs) in their datacenters. However, researchers have shown that cloud FPGAs, when shared ...

It is well-known that for any integral domain R, the Serre conjecture ring R(X), i.e., the localization of the univariate polynomial ring R[X] at monic polynomials, is a Bezout domain of Krull dimension

Side-channel attacks exploit a physical observable originating from a cryptographic device in order to extract its secrets. Many practically relevant advances in the field of side-channel analysis relate to security evaluations of cryptographic functions a ...

Self-attention mechanisms and non-local blocks have become crucial building blocks for state-of-the-art neural architectures thanks to their unparalleled ability in capturing long-range dependencies in the input. However their cost is quadratic with the nu ...

Silicon heterojunction (SHJ) solar cells have recently reached power conversion efficiencies above 25% with various device architectures and with industrial size (>200 cm(2)) wafers. Yet, for an accurate assessment of the efficiency potential and further d ...

Security system designers favor worst-case security metrics, such as those derived from differential privacy (DP), due to the strong guarantees they provide. On the downside, these guarantees result in a high penalty on the system's performance. In this pa ...

In this text, we will show the existence of lattice packings in a family of dimensions by employing division algebras. This construction is a generalization of Venkatesh's lattice packing result Venkatesh (Int Math Res Notices 2013(7): 1628-1642, 2013). In ...

Multiquadratic Rings and Walsh-Hadamard Transforms for Oblivious Linear Function Evaluation

Chat with Graph Search

Secure and Efficient Cryptographic Algorithms in a Quantum World

On the Theory and Practice of Modern Secure Messaging

An Ultra-High Throughput AES-Based Authenticated Encryption Scheme for 6G: Design and Implementation

K3 surfaces, cyclotomic polynomials and orthogonal groups

Side-channel analysis of isogeny-based key encapsulation mechanisms and hash-based digital signatures

Differentially private multi-agent constraint optimization

Security in the Presence of Quantum Adversaries

Extractable Witness Encryption for the Homogeneous Linear Equations Problem

Public-Key Encryption with Quantum Keys

Cryptographic Administration for Secure Group Messaging

Bridging the gap between theoretical and practical privacy technologies for at-risk populations

Thwarting Malicious Adversaries in Homomorphic Encryption Pipelines

On the (Im)possibility of Commitment over Gaussian Unfair Noisy Channels

Temperature Impact on Remote Power Side-Channel Attacks on Shared FPGAs

The multivariate Serre conjecture ring

The Side-channel Metrics Cheat Sheet

Linear Complexity Self-Attention With 3rd Order Polynomials

Loss Analysis of a 24.4%-Efficient Front-Junction Silicon Heterojunction Solar Cell and Opportunity for Localized Contacts

Bayes Security: A Not So Average Metric

Lattice packings through division algebras