3. Problem to solve?
Bitcoin keep money honest proof of work
Ethereum keep contracts honest proof work gas
Maidsafe keep data honest proof of resource
Health ?
– keep science honest proof of evidence
5. Pull Personalised Health
Health of Environment
Well being --- Lifestyle --- Healthy aging
Prevention - Repair – Evidence based
Social Activities Food
Peernetworkvalidateshealthclaims&selfregulates
Living Scientific Knowledge Network
Sensors Genetics DIY
Rea time validation Self regulating
Algorithms
Genetics Attention – Interaction - Action
6. Pull Precision Medicine
Health of Environment
Well being --- Lifestyle --- Healthy aging
Precision Medicine – Evidence based
Mental Medicine Palliative care
Basic Scientific Knowledge
Diagnostic Equip. Drugs Surgery
Clinical trials Regulations
Algorithms
'Peer' review
Genetics Attention – Interaction - Action
8. Xray Workflow
Identity
ML Compute
Sensors - xray
Storage API
Regulation
Compliance
Permissions
Individual
Clinician
Radiog.
ID A
Clin Dr. B
Rad. C
Comp. ML1
Maidsafe
Evidence Chain
Decision
Protocol
Actionxray
9. Early community efforts
Estonia Health Records
White papers clinical trails reproducible science
Government Funding Research
Startups - GEM
Corporate – Philips Blockchain LAB
Code - github
14. ZKP
• Zero-knowledge proof (discrete logs). ZKP. Outlines zero-knowledge proof.
• Zero-knowledge proof (Feige-Fiat-Shamir). ZKP. Outlines zero-knowledge proof
using the Feige-Fiat-Shamir method.
• Zero-knowledge proof (non-interactive random oracle access). ZKP. Non-
interactive random oracle access for the Fiat-Shamir heuristic.
• Zero-knowledge proof (Graphs). ZKP. Outlines zero-knowledge proof using
graphing methods.
• Fair coin flip. ZKP. Outlines how a fair coin flip can be created, without a trusted
verifier.
• Voting with Paillier crypto system. ZKP. Outlines voting with Paillier crypto
system.
• Oblivious transfer. OT. Oblivious transfer.
• Scrambled circuits. Scrambled. Scrambled circuits - SFE.
• Millionaire's Problem . Mill. Yao's Millionaire Problem.
• RAPPOR. RAPPOR. Outlines RAPPOR (Randomized Aggregatable Privacy-
Preserving. Ordinal Response) which allows for privacy in gathered data.
15. Quantum Robust
• Lattice-based cryptography [Lattice] – This classification shows great
potential and is leading to new cryptography, such as for fully
homomorphic encryption [here], and code obfuscation. An example is
given in the following section.
• Code-based cryptography [McEliece] – This method was created in 1978
with the McEliece cryptosystem but has barely been using in real
applications. The McEliece method uses linear codes that are used in
error correcting codes, and involves matrix-vector multiplication. An
example of a linear code is Hamming code [here].
• Multivariate polynomial cryptography [UOV] – These focus on the
difficulty of solving systems of multivariate polynomials over finite
fields. Unfortunately, many of the methods that have been proposed
have already been broken.
• Hash-based signatures [GMSS] – This would involve created digital
signatures using hashing methods. The drawback is that a signer needs
to keep a track of all of the messages that have been signed, and that
there is a limit to the number of signatures that can be produced.