Follow
Renaud Sirdey
Renaud Sirdey
Research Director, Commissariat à l'Energie Atomique, France
Verified email at cea.fr - Homepage
Title
Cited by
Cited by
Year
Towards better availability and accountability for iot updates by means of a blockchain
A Boudguiga, N Bouzerna, L Granboulan, A Olivereau, F Quesnel, ...
2017 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW), 50-58, 2017
2252017
Recent advances in homomorphic encryption: A possible future for signal processing in the encrypted domain
C Aguilar-Melchor, S Fau, C Fontaine, G Gogniat, R Sirdey
IEEE Signal Processing Magazine 30 (2), 108-117, 2013
1702013
Stream ciphers: A practical solution for efficient homomorphic-ciphertext compression
A Canteaut, S Carpov, C Fontaine, T Lepoint, M Naya-Plasencia, ...
Journal of Cryptology 31 (3), 885-916, 2018
1682018
Spatially resolved images of Titan by means of adaptive optics
M Combes, L Vapillon, E Gendron, A Coustenis, O Lai, R Wittemberg, ...
Icarus 129 (2), 482-497, 1997
1031997
ΣC: A programming model and language for embedded manycores
T Goubier, R Sirdey, S Louise, V David
International Conference on Algorithms and Architectures for Parallel …, 2011
872011
Armadillo: a compilation chain for privacy preserving applications
S Carpov, P Dubrulle, R Sirdey
Proceedings of the 3rd International Workshop on Security in Cloud Computing …, 2015
722015
Extended cyclostatic dataflow program compilation and execution for an integrated manycore processor
P Aubry, PE Beaucamps, F Blanc, B Bodin, S Carpov, L Cudennec, ...
Procedia Computer Science 18, 1624-1633, 2013
712013
Towards practical program execution over fully homomorphic encryption schemes
S Fau, R Sirdey, C Fontaine, C Aguilar-Melchor, G Gogniat
2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and …, 2013
472013
Minimizing task preemptions and migrations in multiprocessor optimal real-time schedules
T Megel, R Sirdey, V David
2010 31st IEEE Real-Time Systems Symposium, 37-46, 2010
432010
Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage
S Carpov, J Carlier, D Nace, R Sirdey
Computers & Operations Research 39 (3), 736-745, 2012
402012
Practical privacy-preserving medical diagnosis using homomorphic encryption
S Carpov, TH Nguyen, R Sirdey, G Constantino, F Martinelli
2016 IEEE 9th International Conference on Cloud Computing (CLOUD), 593-599, 2016
382016
On a resource-constrained scheduling problem with application to distributed systems reconfiguration
R Sirdey, J Carlier, H Kerivin, D Nace
European Journal of Operational Research 183 (2), 546-563, 2007
312007
A multi-start heuristic for multiplicative depth minimization of boolean circuits
S Carpov, P Aubry, R Sirdey
International Workshop on Combinatorial Algorithms, 275-286, 2017
222017
Practical fully homomorphic encryption for fully masked neural networks
M Izabachène, R Sirdey, M Zuber
International Conference on Cryptology and Network Security, 24-36, 2019
202019
A parallel simulated annealing approach for the mapping of large process networks
F Galea, R Sirdey
2012 IEEE 26th International Parallel and Distributed Processing Symposium …, 2012
192012
Approximate solution of a resource-constrained scheduling problem
R Sirdey, J Carlier, D Nace
Journal of Heuristics 15 (1), 1-17, 2009
192009
Method for confidentially querying a location-based service by homomorphing cryptography
R Sirdey, S Oana
US Patent 10,754,907, 2020
182020
Faster homomorphic encryption is not enough: Improved heuristic for multiplicative depth minimization of boolean circuits
P Aubry, S Carpov, R Sirdey
Cryptographers’ Track at the RSA Conference, 345-363, 2020
182020
On the limitations of the chimera graph topology in using analog quantum computers
D Vert, R Sirdey, S Louise
Proceedings of the 16th ACM international conference on computing frontiers …, 2019
182019
How to compress homomorphic ciphertexts
A Canteaut, S Carpov, C Fontaine, T Lepoint, M Naya-Plasencia, ...
IACR Cryptology ePrint Archive, 2015
152015
The system can't perform the operation now. Try again later.
Articles 1–20