Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Guillaume Bonnoron

dblp:179/6844 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2018
0000-0003-4864-2355ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
homomorphic encryption
0.312018
Practical Parameters for Somewhat Homomorphic Encryption Schemes on Binary Circuits · IEEE Trans. Computers 2018
Cryptographic primitives and cryptanalysis › cryptographic implementation
parameter selection
0.312018
Practical Parameters for Somewhat Homomorphic Encryption Schemes on Binary Circuits · IEEE Trans. Computers 2018
Cryptographic primitives and cryptanalysis › homomorphic encryption
somewhat homomorphic encryption
0.312018
Practical Parameters for Somewhat Homomorphic Encryption Schemes on Binary Circuits · IEEE Trans. Computers 2018
Cryptographic primitives and cryptanalysis › post-quantum cryptography
lattice-based cryptography
0.112018
Practical Parameters for Somewhat Homomorphic Encryption Schemes on Binary Circuits · IEEE Trans. Computers 2018
Cryptographic primitives and cryptanalysis
post-quantum cryptography
0.112018
Practical Parameters for Somewhat Homomorphic Encryption Schemes on Binary Circuits · IEEE Trans. Computers 2018

Methods — techniques the papers use, named apart from their topics

security analysis · 0.3
YearPublicationVenuePosition
2018 Practical Parameters for Somewhat Homomorphic Encryption Schemes on Binary Circuits
abstract
Post-quantum cryptography gets increasing attention lately, as we have to prepare alternative cryptographic solutions that will resist attacks from quantum computers. A very large effort is being done to replace the usual primitives such as encryption, signature or authentication. This effort also pulls new cryptographic features such as Somewhat or Fully Homomorphic Encryption schemes, based on lattices. Since their introduction in 2009, lots of the burden has been overcome and real applications now become possible. However many papers suffer from the fast constant pace of evolution on the attack side, so their parameter analysis is usually incomplete or obsolete. In this work we present a thorough study of two schemes that have proven their worth: FV and SHIELD, providing a deep analysis of how to setup and size their parameters, to ensure both correctness and security. Our overall aim is to provide easy-to-use guidelines for implementation purposes.
Vincent Migliore, Guillaume Bonnoron, Caroline Fontaine
IEEE Trans. Computers2