What is he best known for?
The fields of study he is best known for:
- Cryptography
- Algebra
- Public-key cryptography
His scientific interests lie mostly in Cryptography, Elliptic curve, Elliptic curve point multiplication, Elliptic Curve Digital Signature Algorithm and Elliptic curve cryptography.
His Cryptography research is multidisciplinary, incorporating perspectives in Exponentiation and Key.
His biological study spans a wide range of topics, including Simple, Abelian group, Scalar multiplication and Arithmetic.
In his study, which falls under the umbrella issue of Elliptic curve, Computational complexity theory and Parallel computing is strongly linked to Side channel attack.
His research in Elliptic curve point multiplication intersects with topics in Discrete mathematics, Tripling-oriented Doche–Icart–Kohel curve, Counting points on elliptic curves and Hessian form of an elliptic curve.
The various areas that he examines in his Elliptic Curve Digital Signature Algorithm study include Jacobian curve, Curve25519, Theoretical computer science and Algebra.
His most cited work include:
- A Practical and Provably Secure Coalition-Resistant Group Signature Scheme (782 citations)
- Cryptographic Hardware and Embedded Systems - CHES 2004 (469 citations)
- The Montgomery Powering Ladder (428 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of study are Cryptography, Theoretical computer science, Encryption, Elliptic curve and Computer security.
He combines subjects such as Exponentiation, Arithmetic and Public-key cryptography with his study of Cryptography.
As a part of the same scientific family, he mostly works in the field of Arithmetic, focusing on Smart card and, on occasion, Embedded system.
His Theoretical computer science study also includes
- Random oracle that intertwine with fields like Schnorr signature,
- Optimal asymmetric encryption padding that intertwine with fields like Padding.
His Elliptic curve study which covers Elliptic curve cryptography that intersects with Discrete mathematics.
His Elliptic curve point multiplication study integrates concerns from other disciplines, such as Supersingular elliptic curve, Counting points on elliptic curves, Jacobian curve, Tripling-oriented Doche–Icart–Kohel curve and Elliptic Curve Digital Signature Algorithm.
He most often published in these fields:
- Cryptography (35.33%)
- Theoretical computer science (22.83%)
- Encryption (20.65%)
What were the highlights of his more recent work (between 2012-2021)?
- Encryption (20.65%)
- Theoretical computer science (22.83%)
- Homomorphic encryption (9.78%)
In recent papers he was focusing on the following fields of study:
Marc Joye mainly focuses on Encryption, Theoretical computer science, Homomorphic encryption, Computer security and Public-key cryptography.
His Theoretical computer science research incorporates elements of Cryptographic primitive, Verifiable secret sharing, Cryptosystem, Key and Plaintext-aware encryption.
His Homomorphic encryption research includes themes of Cryptography, Artificial intelligence, Plaintext, Machine learning and Computation.
His work in the fields of Cryptography, such as Key generation, intersects with other areas such as Regression.
In Computer security, he works on issues like Signature, which are connected to Mode, Adversary and Hardware security module.
As part of one scientific family, Marc Joye deals mainly with the area of Semantic security, narrowing it down to issues related to the Arithmetic, and often Algorithm.
Between 2012 and 2021, his most popular works were:
- Privacy-Preserving Ridge Regression on Hundreds of Millions of Records (263 citations)
- Privacy-preserving matrix factorization (188 citations)
- A Scalable Scheme for Privacy-Preserving Aggregation of Time-Series Data (73 citations)
In his most recent research, the most cited papers focused on:
- Cryptography
- Algebra
- Public-key cryptography
Marc Joye focuses on Theoretical computer science, Encryption, Homomorphic encryption, Cryptography and Plaintext.
His work carried out in the field of Theoretical computer science brings together such families of science as Factorization, Matrix, Standard model and Plaintext-aware encryption.
His Encryption research focuses on Linear subspace and how it relates to Linear span, Malleability, Adaptive chosen-ciphertext attack and Verifiable secret sharing.
His biological study deals with issues like Computation, which deal with fields such as Regularization, Linear regression and Homomorphism.
Marc Joye incorporates Cryptography and Regression in his studies.
His work in Plaintext covers topics such as Public-key cryptography which are related to areas like Adversary, Server, Key generation and Digital signature.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
