What is he best known for?
The fields of study he is best known for:
- Operating system
- The Internet
- Computer network
His main research concerns Computer security, Verifiable secret sharing, Secret sharing, Secret ballot and Homomorphic secret sharing.
His study in Computer security is interdisciplinary in nature, drawing from both Business intelligence and Internet privacy.
Josh Benaloh integrates Secret ballot with Receipt in his study.
His work deals with themes such as Theoretical computer science and Shared secret, which intersect with Homomorphic secret sharing.
His work carried out in the field of Theoretical computer science brings together such families of science as Plaintext, Ciphertext, Probabilistic encryption, Encryption and Attribute-based encryption.
His research integrates issues of Discrete mathematics, Homomorphism, Access structure and Key distribution in his study of Secure multi-party computation.
His most cited work include:
- Electronic online commerce card with customer generated transaction proxy number for online transactions (667 citations)
- Generalized secret sharing and monotone functions (568 citations)
- One-way accumulators: a decentralized alternative to digital signatures (425 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of study are Computer security, Cryptography, Verifiable secret sharing, Key and Internet privacy.
His study looks at the intersection of Computer security and topics like Receipt with Coercion.
Josh Benaloh has researched Verifiable secret sharing in several fields, including Theoretical computer science and Secret sharing.
His research investigates the link between Key and topics such as Cryptographic nonce that cross with problems in Secure communication.
He has included themes like Mandate, Enforcement, Government, The Internet and Law enforcement in his Internet privacy study.
His studies deal with areas such as Masking and Access control as well as Encryption.
He most often published in these fields:
- Computer security (50.68%)
- Cryptography (24.66%)
- Verifiable secret sharing (19.18%)
What were the highlights of his more recent work (between 2014-2019)?
- Computer security (50.68%)
- Internet privacy (16.44%)
- Cryptography (24.66%)
In recent papers he was focusing on the following fields of study:
Josh Benaloh focuses on Computer security, Internet privacy, Cryptography, Ballot and Adversarial system.
His research in the fields of End-to-end principle overlaps with other disciplines such as Work.
The Internet privacy study combines topics in areas such as Enforcement, Law enforcement, The Internet and Mandate.
The various areas that Josh Benaloh examines in his Cryptography study include Adversary and Information privacy.
Representation, Public trust, Publication, Transparency and Verifiable secret sharing are fields of study that intersect with his Ballot research.
His work carried out in the field of Adversarial system brings together such families of science as Secrecy and Key.
Between 2014 and 2019, his most popular works were:
- Keys under doormats: mandating insecurity by requiring government access to all data and communications (61 citations)
- Improving Privacy in Cryptographic Elections (23 citations)
- Keys under doormats (17 citations)
In his most recent research, the most cited papers focused on:
- The Internet
- Operating system
- Computer network
Internet privacy, Law enforcement, The Internet, Enforcement and Mandate are his primary areas of study.
His Internet privacy study integrates concerns from other disciplines, such as Computer security and Key escrow.
The study incorporates disciplines such as Government and Data Protection Act 1998 in addition to Key escrow.
His Information privacy study combines topics from a wide range of disciplines, such as Open problem and Cryptography.
Josh Benaloh connects Extension with Government in his research.
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.
