Renaud Sirdey

Orcid: 0000-0003-4720-9269

According to our database1, Renaud Sirdey authored at least 113 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Designing a General-Purpose 8-bit (T)FHE Processor Abstraction.
IACR Cryptol. ePrint Arch., 2024

Chocobo: Creating Homomorphic Circuit Operating with Functional Bootstrapping in basis B.
IACR Cryptol. ePrint Arch., 2024

On the practical CPAD security of "exact" and threshold FHE schemes and libraries.
IACR Cryptol. ePrint Arch., 2024

Relations among new CCA security notions for approximate FHE.
IACR Cryptol. ePrint Arch., 2024

Benchmarking quantum annealing with maximum cardinality matching problems.
Frontiers Comput. Sci., 2024

FairCognizer: A Model for Accurate Predictions with Inherent Fairness Evaluation.
Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

On the Practical CPA<sup>D</sup> Security of "exact" and Threshold FHE Schemes and Libraries.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023
First Attempts at Cryptanalyzing a (Toy) Block Cipher by Means of Quantum Optimization Approaches.
J. Comput. Sci., May, 2023

At Last! A Homomorphic AES Evaluation in Less than 30 Seconds by Means of TFHE.
IACR Cryptol. ePrint Arch., 2023

Homomorphic Sortition - Single Secret Leader Election for PoS Blockchains.
IACR Cryptol. ePrint Arch., 2023

Practical Homomorphic Evaluation of Block-Cipher-Based Hash Functions with Applications.
IACR Cryptol. ePrint Arch., 2023

Optimized stream-cipher-based transciphering by means of functional-bootstrapping.
IACR Cryptol. ePrint Arch., 2023

Practical Homomorphic Aggregation for Byzantine ML.
CoRR, 2023

When approximate design for fast homomorphic computation provides differential privacy guarantees.
CoRR, 2023

A Homomorphic AES Evaluation in Less than 30 Seconds by Means of TFHE.
Proceedings of the 11th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, 2023

A Probabilistic Design for Practical Homomorphic Majority Voting with Intrinsic Differential Privacy.
Proceedings of the 11th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, 2023

Lightweight FHE-based Protocols Achieving Results Consistency for Data Encrypted Under Different Keys.
Proceedings of the 20th International Conference on Security and Cryptography, 2023

Combining homomorphic encryption and differential privacy in federated learning.
Proceedings of the 20th Annual International Conference on Privacy, Security and Trust, 2023

Solving Higher Order Binary Optimization Problems on NISQ Devices: Experiments and Limitations.
Proceedings of the Computational Science - ICCS 2023, 2023

TAQOS: A Benchmark Protocol for Quantum Optimization Systems.
Proceedings of the Computational Science - ICCS 2023, 2023

Practical Multi-Key Homomorphic Encryption for More Flexible and Efficient Secure Federated Average Aggregation.
Proceedings of the IEEE International Conference on Cyber Security and Resilience, 2023

Building Blocks for LSTM Homomorphic Evaluation with TFHE.
Proceedings of the Cyber Security, Cryptology, and Machine Learning, 2023

ComBo: A Novel Functional Bootstrapping Method for Efficient Evaluation of Nonlinear Functions in the Encrypted Domain.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2023, 2023

2022
Practical Multi-Key Homomorphic Encryption for More Flexible and Efficient Secure Federated Aggregation (preliminary work).
IACR Cryptol. ePrint Arch., 2022

Putting up the swiss army knife of homomorphic calculations by means of TFHE functional bootstrapping.
IACR Cryptol. ePrint Arch., 2022

Homomorphic Sortition - Secret Leader Election for Blockchain.
CoRR, 2022

Protecting Data from all Parties: Combining FHE and DP in Federated Learning.
CoRR, 2022

A Secure Federated Learning: Analysis of Different Cryptographic Tools.
Proceedings of the 19th International Conference on Security and Cryptography, 2022

SecTL: Secure and Verifiable Transfer Learning-based inference.
Proceedings of the 8th International Conference on Information Systems Security and Privacy, 2022

A First Attempt at Cryptanalyzing a (Toy) Block Cipher by Means of QAOA.
Proceedings of the Computational Science - ICCS 2022, 2022

Quantum Approaches for WCET-Related Optimization Problems.
Proceedings of the Computational Science - ICCS 2022, 2022

2021
Benchmarking Quantum Annealing Against "Hard" Instances of the Bipartite Matching Problem.
SN Comput. Sci., 2021

Efficient homomorphic evaluation of k-NN classifiers.
Proc. Priv. Enhancing Technol., 2021

SPEED: secure, PrivatE, and efficient deep learning.
Mach. Learn., 2021

RandSolomon: optimally resilient multi-party random number generation protocol.
CoRR, 2021

Towards a Quantum Algorithm for Evaluating WCETs.
Proceedings of the Short Papers Proceedings of the 2nd International Workshop on Software Engineering & Technology (Q-SET 2021) co-located with IEEE International Conference on Quantum Computing and Engineering (IEEE Quantum Week 2021), 2021

RandSolomon: Optimally Resilient Random Number Generator with Deterministic Termination.
Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

Cloud-based Private Querying of Databases by Means of Homomorphic Encryption.
Proceedings of the 6th International Conference on Internet of Things, 2021

Revisiting Stream-Cipher-Based Homomorphic Transciphering in the TFHE Era.
Proceedings of the Foundations and Practice of Security - 14th International Symposium, 2021

2020
Illuminating the Dark or how to recover what should not be seen in FE-based classifiers.
Proc. Priv. Enhancing Technol., 2020

Operational Quantum Annealers are Cursed by their Qubits Interconnection Topologies.
Proceedings of the 2020 IEEE Computer Society Annual Symposium on VLSI, 2020

Revisiting Old Combinatorial Beasts in the Quantum Age: Quantum Annealing Versus Maximal Matching.
Proceedings of the Computational Science - ICCS 2020, 2020

Computing Neural Networks with Homomorphic Encryption and Verifiable Computing.
Proceedings of the Applied Cryptography and Network Security Workshops, 2020

2019
Towards real-time hidden speaker recognition by means of fully homomorphic encryption.
IACR Cryptol. ePrint Arch., 2019

Faster homomorphic encryption is not enough: improved heuristic for multiplicative depth minimization of Boolean circuits.
IACR Cryptol. ePrint Arch., 2019

Enhancing CAN Security by Means of Lightweight Stream-Ciphers and Protocols.
Proceedings of the Computer Safety, Reliability, and Security, 2019

On the limitations of the chimera graph topology in using analog quantum computers.
Proceedings of the 16th ACM International Conference on Computing Frontiers, 2019

Practical Fully Homomorphic Encryption for Fully Masked Neural Networks.
Proceedings of the Cryptology and Network Security - 18th International Conference, 2019

2018
Data Flow Oriented Hardware Design of RNS-based Polynomial Multiplication for SHE Acceleration.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2018

Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression.
J. Cryptol., 2018

Illuminating the Dark or how to recover what should not be seen.
IACR Cryptol. ePrint Arch., 2018

A SaaS Implementation of a New Generic Crypto-Classifier Service for Secure Energy Efficiency in Smart Cities.
Proceedings of the Smart Cities, Green Technologies and Intelligent Transport Systems, 2018

Thwarting Fault Attacks against Lightweight Cryptography using SIMD Instructions.
Proceedings of the IEEE International Symposium on Circuits and Systems, 2018

Practical personalized genomics in the encrypted domain.
Proceedings of the Third International Conference on Fog and Mobile Edge Computing, 2018

Privacy-Preserving Tax Calculations in Smart Cities by Means of Inner-Product Functional Encryption.
Proceedings of the 2nd Cyber Security in Networking Conference, 2018

Towards Video Compression in the Encrypted Domain: A Case-Study on the H264 and HEVC Macroblock Processing Pipeline.
Proceedings of the Cryptology and Network Security - 17th International Conference, 2018

2017
A New Crypto-Classifier Service for Energy Efficiency in Smart Cities.
IACR Cryptol. ePrint Arch., 2017

Thwarting Fault Attacks using the Internal Redundancy Countermeasure (IRC).
IACR Cryptol. ePrint Arch., 2017

DFA on LS-Designs with a Practical Implementation on SCREAM (extended version).
IACR Cryptol. ePrint Arch., 2017

A First DFA on PRIDE: from Theory to Practice (extended version).
IACR Cryptol. ePrint Arch., 2017

An Analysis of FV Parameters Impact Towards its Hardware Acceleration.
IACR Cryptol. ePrint Arch., 2017

A multi-start heuristic for multiplicative depth minimization of boolean circuits.
IACR Cryptol. ePrint Arch., 2017

Running compression algorithms in the encrypted domain: a case-study on the homomorphic execution of RLE.
IACR Cryptol. ePrint Arch., 2017

Improved compact formulations for a wide class of graph partitioning problems in sparse graphs.
Discret. Optim., 2017

Information Leakage Analysis of Inner-Product Functional Encryption Based Data Classification.
Proceedings of the 15th Annual Conference on Privacy, Security and Trust, 2017

Exploration of de Bruijn Graph Filtering for de novo Assembly Using GraphLab.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium Workshops, 2017

Towards Confidentiality-strengthened Personalized Genomic Medicine Embedding Homomorphic Cryptography.
Proceedings of the 3rd International Conference on Information Systems Security and Privacy, 2017

Privacy Preserving Data Classification using Inner-product Functional Encryption.
Proceedings of the 3rd International Conference on Information Systems Security and Privacy, 2017

Towards Better Availability and Accountability for IoT Updates by Means of a Blockchain.
Proceedings of the 2017 IEEE European Symposium on Security and Privacy Workshops, 2017

DFA on LS-Designs with a Practical Implementation on SCREAM.
Proceedings of the Constructive Side-Channel Analysis and Secure Design, 2017

2016
Stochastic graph partitioning: quadratic versus SOCP formulations.
Optim. Lett., 2016

Privacy Preserving Data Classification Using Inner Product Encryption.
Proceedings of the Security and Privacy in Communication Networks, 2016

A Semi-Greedy Heuristic for the Mapping of Large Task Graphs.
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium Workshops, 2016

Leveraging distributed GraphLab for program trace analysis.
Proceedings of the International Conference on High Performance Computing & Simulation, 2016

A First DFA on PRIDE: From Theory to Practice.
Proceedings of the Risks and Security of Internet and Systems, 2016

An Architecture for Practical Confidentiality-Strengthened Face Authentication Embedding Homomorphic Cryptography.
Proceedings of the 2016 IEEE International Conference on Cloud Computing Technology and Science, 2016

Dynamic Execution of Secure Queries over Homomorphic Encrypted Databases.
Proceedings of the 4th ACM International Workshop on Security in Cloud Computing, 2016

Another Compression Method for Homomorphic Ciphertexts.
Proceedings of the 4th ACM International Workshop on Security in Cloud Computing, 2016

Practical Privacy-Preserving Medical Diagnosis Using Homomorphic Encryption.
Proceedings of the 9th IEEE International Conference on Cloud Computing, 2016

2015
A compression method for homomorphic ciphertexts.
IACR Cryptol. ePrint Arch., 2015

How to Compress Homomorphic Ciphertexts.
IACR Cryptol. ePrint Arch., 2015

A GRASP metaheuristic for the robust mapping and routing of dataflow process networks on manycore architectures.
4OR, 2015

Blind hypervision to protect virtual machine privacy against hypervisor escape vulnerabilities.
Proceedings of the 13th IEEE International Conference on Industrial Informatics, 2015

Introduction to Optimization Under Uncertainty Techniques for High-Performance Multicore Embedded Systems Compilation.
Proceedings of the Computational Intelligence in Digital and Network Designs and Applications, 2015

2014
Armadillo: a compilation chain for privacy preserving applications.
IACR Cryptol. ePrint Arch., 2014

The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks.
J. Heuristics, 2014

Fast Generation of Large Task Network Mappings.
Proceedings of the 2014 IEEE International Parallel & Distributed Processing Symposium Workshops, 2014

Generating Code and Memory Buffers to Reorganize Data on Many-core Architectures.
Proceedings of the International Conference on Computational Science, 2014

An Approximate Method for Throughput Evaluation of Cyclo-static Dataflow Programs.
Proceedings of the Eighth International Conference on Complex, 2014

2013
Recent Advances in Homomorphic Encryption: A Possible Future for Signal Processing in the Encrypted Domain.
IEEE Signal Process. Mag., 2013

Throughput Constrained Parallelism Reduction in Cyclo-static Dataflow Applications.
Proceedings of the International Conference on Computational Science, 2013

Extended Cyclostatic Dataflow Program Compilation and Execution for an Integrated Manycore Processor.
Proceedings of the International Conference on Computational Science, 2013

A GRASP for Placement and Routing of Dataflow Process Networks on Many-Core Architectures.
Proceedings of the Eighth International Conference on P2P, 2013

Authentication and Secured Execution for the Infrastructure-as-a-Service Layer of the Cloud Computing Model.
Proceedings of the Eighth International Conference on P2P, 2013

Towards Practical Program Execution over Fully Homomorphic Encryption Schemes.
Proceedings of the Eighth International Conference on P2P, 2013

2012
Parallelism Reduction Based on Pattern Substitution in Dataflow Oriented Programming Languages.
Proceedings of the International Conference on Computational Science, 2012

Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage.
Comput. Oper. Res., 2012

A Parallel Simulated Annealing Approach for the Mapping of Large Process Networks.
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 2012

A low-overhead dedicated execution support for stream applications on shared-memory cmp.
Proceedings of the 12th International Conference on Embedded Software, 2012

2011
Probabilistic Parameters of Conditional Task Graphs.
Proceedings of the 14th International Conference on Network-Based Information Systems, 2011

ΣC: A Programming Model and Language for Embedded Manycores.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2011

Task Ordering and Memory Management Problem for Degree of Parallelism Estimation.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

Contributions à l'optimisation combinatoire pour l'embarqué : des autocommutateurs cellulaires aux microprocesseurs massivement parallèles. (Contributions to combinatorial optimization for embedded computing : from wireless switching systems to massively parallel microprocessors).
, 2011

2010
Speculative data prefetching for branching structures in dataflow programms.
Electron. Notes Discret. Math., 2010

A linear programming approach to general dataflow process network verification and dimensioning
Proceedings of the Proceedings Third Interaction and Concurrency Experience: Guaranteed Interaction, 2010

Minimizing Task Preemptions and Migrations in Multiprocessor Optimal Real-Time Schedules.
Proceedings of the 31st IEEE Real-Time Systems Symposium, 2010

2009
Approximate solution of a resource-constrained scheduling problem.
J. Heuristics, 2009

2008
A linear programming approach to highly precise clock synchronization over a packet network.
4OR, 2008

Models and algorithms for the reconfiguration of distributed wireless switching systems.
4OR, 2008

2007
Modèles et algorithmes pour la reconfiguration de systèmes répartis utilisés en téléphonie cellulaire. (Models and algorithms for the reconfiguration of wireless switching systems).
PhD thesis, 2007

A branch-and-cut algorithm for a resource-constrained scheduling problem.
RAIRO Oper. Res., 2007

On a resource-constrained scheduling problem with application to distributed systems reconfiguration.
Eur. J. Oper. Res., 2007

Combinatorial optimization problems in wireless switch design.
4OR, 2007


  Loading...