On Succinct Non-interactive Arguments in Relativized Worlds

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (30)

Low-Rank Tensor Approximations for Solving Multimarginal Optimal Transport Problems\ast

Daniel Kressner, Christoph Max Strössner

By the addition of entropic regularization, multimarginal optimal transport problems can be trans-formed into tensor scaling problems, which can be solved numerically using the multimarginal Sinkhorn algorithm. The main computational bottleneck of this alg ...

SIAM PUBLICATIONS2023

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

Mirjana Stojilovic, Ognjen Glamocanin, Mathias Josef Payer, Hajira Shafqat Bazaz

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

IEEE2023

From Automated Bootstrapping to Collaborative Editing: A Framework for 4D City Reconstruction

Didier Louis Dupertuis, Rémi Guillaume Petitpierre, Paul Robert Guhennec, Beatrice Vaienti

We propose a framework for the construction of 4D scientific models for cities of the past. It leverages both the use of computational methods for bootstrapping, and a collaborative interface for visualisation and edition. This permits to continuously enri ...

Zenodo2023

Hardware-Software co-design Methodologies for Edge AI Optimization

Flavio Ponzina

ML-based edge devices may face memory and computational errors that affect applications' reliability and performance. These errors can be the result of particular working conditions (e.g., radiation areas in physical experiments or avionics) or could be th ...

EPFL2023

A mixed precision LOBPCG algorithm

Daniel Kressner, Meiyue Shao, Yuxin Ma

The locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm is a popular approach for computing a few smallest eigenvalues and the corresponding eigenvectors of a large Hermitian positive definite matrix A. In this work, we propose a mix ...

SPRINGER2023

A Gapless Post-quantum Hash Proof System in the Hamming Metric

Serge Vaudenay, Bénédikt Minh Dang Tran

A hash proof system (HPS) is a form of implicit proof of membership to a language. Out of the very few existing post-quantum HPS, most are based on languages of ciphertexts of code-based or lattice-based cryptosystems and inherently suffer from a gap cause ...

2023

Reliable Microsecond-Scale Distributed Computing

Athanasios Xygkis

The landscape of computing is changing, thanks to the advent of modern networking equipment that allows machines to exchange information in as little as one microsecond. Such advancement has enabled microsecond-scale distributed computing, where entire dis ...

EPFL2023

3DHumanGAN: 3D-Aware Human Image Generation with 3D Pose Mapping

Siyuan Li, Zhuoqian Yang

We present 3DHumanGAN, a 3D-aware generative adversarial network that synthesizes photo-like images of fullbody humans with consistent appearances under different view-angles and body-poses. To tackle the representational and computational challenges in sy ...

Ieee Computer Soc2023

Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier

Alessandro Chiesa, Siqi Liu

Interactive oracle proofs (IOPs) are a multi-round generalization of probabilistically checkable proofs that play a fundamental role in the construction of efficient cryptographic proofs. ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

Attacks on some post-quantum cryptographic protocols: The case of the Legendre PRF and SIKE

Novak Kaluderovic

Post-quantum cryptography is a branch of cryptography which deals with cryptographic algorithms whose hardness assumptions are not based on problems known to be solvable by a quantum computer, such as the RSA problem, factoring or discrete logarithms. This ...

EPFL2022

Page 2 sur 2