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.

Sebastien Beugnon

dblp:210/2980 · also Sébastien Beugnon · DBLP profile ↗
← Back
6ranked-venue papers
5as first author
1since 2021 · last 2022
0000-0002-5984-5177ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 6 · 5 first-author · 1 since 2021

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 protocols and secure computation · 77% Cryptographic primitives and cryptanalysis · 23%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation
secret sharing
0.412019
Format-Compliant Selective Secret 3-D Object Sharing Scheme · IEEE Trans. Multim. 2019
Cryptographic primitives and cryptanalysis › encryption
selective encryption
0.112019
Format-Compliant Selective Secret 3-D Object Sharing Scheme · IEEE Trans. Multim. 2019

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

secret sharing · 0.4format-compliant encryption · 0.4
YearPublicationVenuePosition
2022 A 3D Visual Security (3DVS) score to measure the visual security level of selectively encrypted 3D objects
Sebastien Beugnon, Bianca Jansen Van Rensburg, Naima Amalou, William Puech, Jean-Pierre Pedeboy
Signal Process. Image Commun.1
2019 A Format-compliant Selective Secret 3D Object Sharing Scheme Based on Shamir's Scheme
abstract
New issues have arisen in the creation of 3D objects linked to collaboration in 3D workflows. In this kind of usage it may be necessary to allow access and to share a lower quality file of a 3D object for some collaborators. In this paper, we present a Format-Compliant Selective Secret 3D Object Sharing (FCSS3DOS) scheme, which visually protects the content using geometrical distortions by selectively sharing bits of a 3D object's geometry using Shamir's Secret Sharing scheme. The degradation level D is selected before the sharing process and determines how much geometrical distortions are induced into n generated shared 3D objects which are given to n participants. When at least k or more participants agree to combine their own shared 3D objects, then the secret 3D object can be recovered without distortion. The value of k can vary between 2 and n. In experimental results, we ana-lyze the degradation level D that influences the geometrical distortions induced into shared 3D objects.
Sebastien Beugnon, William Puech, Jean-Pierre Pedeboy
ICASSP1
2019 Privacy Protection for Social Media Based on A Hierarchical Secret Image Sharing Scheme
abstract
Social network development raises many issues relating to privacy protection for images. In particular, multi-party privacy protection conflicts can take place when an image is published by only one of its owners. Indeed, privacy settings applied to this image are those of its owner and people on the image are not involved in the process. In this paper, we propose a new hierarchical secret image sharing scheme for social networks in order to answer this problem. Based on the disjunctive multi-level approach of Belenkiy applied to images, this solution ensures user privacy, as shown by our obtained experimental results.
Sebastien Beugnon, Pauline Puteaux, William Puech
ICIP1
2019 Format-Compliant Selective Secret 3-D Object Sharing Scheme
abstract
This paper presents a new method of secret three-dimensional object sharing (S3DOS), which allows sharing of three-dimensional (3-D) objects, while preserving its file format by selectively encrypting a 3-D object in order to sufficiently protect the visual nature of the content. This scheme, named format-compliant selective (k, n) S3DOS, modifies selected bits of the vertices of a 3-D object to protect the visual content by inducing geometrical distortions. These distortions are controlled thanks to the application of a degradation level at the beginning of the sharing process. To reconstruct the secret 3-D object, at least k shared 3-D objects among n have to be combined in order to remove the geometrical distortions and recover the exact original 3-D object. Experimental results are presented and evaluated to showcase the feasibility of the proposed scheme.
Sebastien Beugnon, William Puech, Jean-Pierre Pedeboy
IEEE Trans. Multim.1
2017 Rethinking the high capacity 3D steganography: Increasing its resistance to steganalysis
abstract
3D steganography is used in order to embed or hide information into 3D objects without causing visible or machine detectable modifications. In this paper we rethink about a high capacity 3D steganography based on the Hamiltonian path quantization, and increase its resistance to steganalysis. We analyze the parameters that may influence the distortion of a 3D shape as well as the resistance of the steganography to 3D steganalysis. According to the experimental results, the proposed high capacity 3D steganographic method has an increased resistance to steganalysis.
Zhenyu Li 0004, Sebastien Beugnon, William Puech, Adrian G. Bors
ICIP2
2017 An efficient lossless (2, n) secret image sharing based on Blakley's scheme
abstract
Visual Secret Sharing (VSS) is a type of cryptographic method used to secure digital media such as images by splitting it into n shares. Then, with k or more shares, the secret media can be reconstructed. Without the required number of shares, they are totally useless individually. The purpose of secret sharing methods is to reinforce the cryptographic approach from different points of failure as a single information-container. Instead of Lagrange's interpolation employed by classical methods, an approach based on linear equations and coding theory resolves the classic problems of VSS methods like pixel expansion and information losses at recovery time. In this paper, we propose an efficient (2, n) secret image sharing scheme without loss of information and size increase of shares, with n ≤ 7 based on linear equations encoded into eight bits to encode separately pixels and permutations to maintain high entropy in shares.
Sebastien Beugnon, William Puech, Jean-Pierre Pedeboy
MMSP1