Publications related to LPN in Cryptography

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.

Delay with network coding and feedback

Christina Fragouli, Lorenzo Keller

We consider the problem of minimizing delay when broadcasting over erasure channels with feedback. A sender wishes to communicate the same set of mu messages to several receivers over separate erasure channels. The sender can broadcast a single message or ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

Reducing Memory Requirements for Combinatorial Attacks on NTRU via Multiple Birthdays

In this paper we view the possibilities to lance a multiple (iterative) birthday attack on NTRU. Recently Wagner's algorithm for the generalized birthday problem [9] allowed to speed-up several combinatorial attacks. However, in the case of NTRU we can not ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009

YaQ: An Architecture for Real-Time Navigation and Rendering of Varied Crowds

Daniel Thalmann, Jonathan Maim, Barbara Yersin

The YaQ software platform is a complete system dedicated to real-time crowd simulation and rendering. Fitting multiple application domains, such as video games and VR, YaQ aims to provide efficient algorithms to generate crowds comprising up to thousands o ...

Institute of Electrical and Electronics Engineers2009

Performance Analysis of a Hybrid Incremental and Cyclic A/D Conversion Principle

Pierre-André Farine, Luca Rossi, Steve Tanner

This paper presents a new hybrid A/D conversion principle based on the combination of an incremental conversion for the most significant part of the result and on a cyclic conversion for the least significant part. The proposed approach exhibits a resoluti ...

2009

Iterative Demosaicking Accelerated: Theory and Fast Noniterative Implementations

Martin Vetterli, Yue Lu, Mina Karzand

Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we present a rigorous treatment of a classical demosaicking algorithm based on alternating projections (AP). Since its publication, the AP algorithm has been widely c ...

2009

The Complexity of Distinguishing Distributions

Serge Vaudenay, Thomas Baignères

Cryptography often meets the problem of distinguishing distributions. In this paper we review techniques from hypothesis testing to express the advantage of the best distinguisher limited to a given number of samples. We link it with the Chernoff informati ...

Springer2008

A multiple birthday attack on NTRU

In this paper we view the possibilities to lance a multiple (iterative) birthday attack on NTRU. Recently Wagner's algorithm for the generalized birthday problem (Wagner, 2002) allowed to speed-up several combinatorial attacks. However, in the case of NTRU ...

Insticc-Inst Syst Technologies Information Control & Communication, Avenida D Manuel L, 27A 2 Esquerdo, Setubal, 2910-595, Portugal2008

GossiCrypt: Wireless Sensor Network Data Confidentiality Against Parasitic Adversaries

Jean-Pierre Hubaux, Panagiotis Papadimitratos, Jun Luo

Abstract—Resource and cost constraints remain a challenge for wireless sensor network security. In this paper, we propose a new approach to protect confidentiality against a parasitic adversary, which seeks to exploit sensor networks by obtaining measureme ...

2008

Multiple Heterogeneous Ant Colonies with Information Exchange

Arash Arami, Bijan Rahimzadeh Rofoee

The method of multiple heterogeneous ant colonies with information exchange (MHACIE) is presented in this paper with emphasis on the speed of finding the optimal solution and the corresponding computational complexity. The proposed method which is inspired ...

2008

LPN in Cryptography

Graph Chatbot

Chat with Graph Search

Delay with network coding and feedback

Reducing Memory Requirements for Combinatorial Attacks on NTRU via Multiple Birthdays

User-Aided Data Authentication

YaQ: An Architecture for Real-Time Navigation and Rendering of Varied Crowds

Performance Analysis of a Hybrid Incremental and Cyclic A/D Conversion Principle

Iterative Demosaicking Accelerated: Theory and Fast Noniterative Implementations

The Complexity of Distinguishing Distributions

A multiple birthday attack on NTRU

GossiCrypt: Wireless Sensor Network Data Confidentiality Against Parasitic Adversaries

Multiple Heterogeneous Ant Colonies with Information Exchange

User-Aided Data Authentication

Delay with network coding and feedback

Reducing Memory Requirements for Combinatorial Attacks on NTRU via Multiple Birthdays

Performance Analysis of a Hybrid Incremental and Cyclic A/D Conversion Principle

YaQ: An Architecture for Real-Time Navigation and Rendering of Varied Crowds

Iterative Demosaicking Accelerated: Theory and Fast Noniterative Implementations

The Complexity of Distinguishing Distributions

A multiple birthday attack on NTRU

GossiCrypt: Wireless Sensor Network Data Confidentiality Against Parasitic Adversaries

Multiple Heterogeneous Ant Colonies with Information Exchange