Feistel Structures for MPC, and More

We study approaches to generalized Feistel constructions with low-degree round functions with a focus on x -> x^3 . Besides known constructions, we also provide a new balanced Feistel construction with improved diffusion properties. This then allows us to propose more efficient generalizations of the MiMC design (Asiacrypt’16), which we in turn evaluate in three application areas. Whereas MiMC was not competitive at all in a recently proposed new class of PQ-secure signature schemes, our new construction leads to about 30 times smaller signatures than MiMC. In MPC use cases, where MiMC outperforms all other competitors, we observe improvements in throughput by a factor of more than 4 and simultaneously a 5-fold reduction of preprocessing effort, albeit at the cost of a higher latency. Another use case where MiMC already outperforms other designs, in the area of SNARKs, sees modest improvements. Additionally, this use case benefits from the flexibility to use smaller fields

Boolean functions for homomorphic-friendly stream ciphers

The proliferation of small embedded devices having growing but still limited computing and data storage facilities, and the related development of cloud services with extensive storage and computing means, raise nowadays new privacy issues because of the outsourcing of data processing. This has led to a need for symmetric cryptosystems suited for hybrid symmetric-FHE encryption protocols, ensuring the practicability of the FHE solution. Recent ciphers meant for such use have been introduced, such as LowMC, Kreyvium, FLIP, and Rasta. The introduction of stream ciphers devoted to symmetric-FHE frameworks such as FLIP and its recent modification has in its turn posed new problems on the Boolean functions to be used in them as filter functions. We recall the state of the art in this matter and present further studies (without proof)

On the Concrete Security of Goldreich’s Pseudorandom Generator

International audienceLocal pseudorandom generators allow to expand a short random string into a long pseudo-random string, such that each output bit depends on a constant number d of input bits. Due to its extreme efficiency features, this intriguing primitive enjoys a wide variety of applications in cryptography and complexity. In the polynomial regime, where the seed is of size n and the output of size n s for s > 1, the only known solution, commonly known as Goldreich's PRG, proceeds by applying a simple d-ary predicate to public random sized subsets of the bits of the seed. While the security of Goldreich's PRG has been thoroughly investigated, with a variety of results deriving provable security guarantees against class of attacks in some parameter regimes and necessary criteria to be satisfied by the underlying predicate, little is known about its concrete security and efficiency. Motivated by its numerous theoretical applications and the hope of getting practical instantiations for some of them, we initiate a study of the concrete security of Goldreich's PRG, and evaluate its resistance to cryptanalytic attacks. Along the way, we develop a new guess-and-determine-style attack, and identify new criteria which refine existing criteria and capture the security guarantees of candidate local PRGs in a more fine-grained way

Human immunodeficiency virus continuum of care in 11 european union countries at the end of 2016 overall and by key population: Have we made progress?

Background. High uptake of antiretroviral treatment (ART) is essential to reduce human immunodeficiency virus (HIV) transmission and related mortality; however, gaps in care exist. We aimed to construct the continuum of HIV care (CoC) in 2016 in 11 European Union (EU) countries, overall and by key population and sex. To estimate progress toward the Joint United Nations Programme on HIV/AIDS (UNAIDS) 90-90-90 target, we compared 2016 to 2013 estimates for the same countries, representing 73% of the population in the region. Methods. A CoC with the following 4 stages was constructed: number of people living with HIV (PLHIV); proportion of PLHIV diagnosed; proportion of those diagnosed who ever initiated ART; and proportion of those ever treated who achieved viral suppression at their last visit. Results. We estimated that 87% of PLHIV were diagnosed; 92% of those diagnosed had ever initiated ART; and 91% of those ever on ART, or 73% of all PLHIV, were virally suppressed. Corresponding figures for men having sex with men were: 86%, 93%, 93%, 74%; for people who inject drugs: 94%, 88%, 85%, 70%; and for heterosexuals: 86%, 92%, 91%, 72%. The proportion suppressed of all PLHIV ranged from 59% to 86% across countries. Conclusions. The EU is close to the 90-90-90 target and achieved the UNAIDS target of 73% of all PLHIV virally suppressed, significant progress since 2013 when 60% of all PLHIV were virally suppressed. Strengthening of testing programs and treatment support, along with prevention interventions, are needed to achieve HIV epidemic control. © The Author(s) 2020