four fundamental future facets of cyber-security kannan ...aphrdi/2016/08_… · aryabhatta’s...
TRANSCRIPT
Four Famous Proverbs● Well begun is half done!
● Seek out the seed of triumph in every adversity!
● It is better to know some of the
questions than all of the answers!
● All’s well that ends well!
Well begun is half done!Exemplary samples include:
● Aryabhatta’s Zero
● Church-Turing Hypothesis
● Shannon Information and Digitalization
● Von Neumann Architecture
● Trans-disciplinary links and Reductions
● Kerckhoffs's principle
● Provable Security
Our First Future Facet of Cyber-Security
Quantum Complexity and One-Way Functions
Quantum Start to Crypto!
Qubits● A quantum bit, or qubit, is a unit vector in a two dimensional
complex vector space for which a particular basis has been fixed and is denoted by:
{|0›, |1›}
● Qubits can be in a superposition of |0› and |1› such as
a|0› +b |1›
where a and b are complex numbers such that |a|2 + |b|2 = 1.
Measuring a Qubit in the Basis
For the qubit
a|0› +b |1›
the probability that the measured value is |0› is
|a|2
after which the state collapses to |0› and
the probability that the measured value is |1› is
|b|2
after which the state collapses to |1›
Quantum World: It’s More Bizarre!
▪ Superposition▪ Alive-and-Dead Cat
▪ Collapse▪ Measurement affects quantum state
▪ Uncertainty▪ A Theoretical Limitation
▪ Indistinguishability▪ Non-orthogonal states aren’t fully distinguished
▪ No-Cloning▪ Arbitrary unknown states cannot be reliably copied
▪ Entanglement▪ Spooky effect at a distance
▪ Parallelism ▪ Beware of Tensors: Dimensions Multiply!
Quantum Secret Key Establishment Protocol
● Two bases are used, say b1 and b2
.● S chooses a random base,
and based on the bit to send, it sends a qubit prepared in the corresponding state.
● R measures the qubit received, with a random base. If the base is different from what S used, the bit is lost, else R measures the actual bit (always so, only if an eavesdropper is absent!).
Bit 0 1
b1
b2
Amazing Anomalous Advantages of Adversity!
Exemplary samples include:
● Randomization
● Computational Difficulty
● Quantum Uncertainty and No-Cloning
● Game Theory and Byzantium
● Secure Communication in Noisy Channels
Our Second Future Facet of Cyber-Security
Utilizing Uncertainties For Improved Security
More Adversity is Better!Faults and failures
Asynchrony and delays
Mobility and churn
Bugs and more bugs
Dishonesty and malice
Noise and natural diffusions
Quantum collapse and decoherance
Congestion and clutter
Chaos and sensitivity
Disorder and dynamics
. . .
Example: Secure Communication
● Shannon’s Result: Information-theoretically Secure Communication is Impossible in a Noiseless Insecure Channel
● Information-theoretically Secure Communication is possible in an appropriately Noisy Insecure Channel
adversary
Sender ReceiverInsecure channel
Is it noisy?
Clash of Philosophies!
Exemplary samples include:
● What is a proof?◦ Mathematics versus Computing
● What is time, and space?◦ Physics versus Algorithms
● What is efficiency?◦ Concrete versus Asymptotic
● What is the best solution?◦ Resource precedence versus re-usability
Our Third Future Facet of Cyber-Security
Whole is greater than sum-of-partsIs Security Emergent?
What is a fault?
Who is honest?
What is foreground/background?
Can a cluster of insecure systems-
simulate security?
What is a security policy?…
…
All’s Well That Ends Well!Exemplary samples include:
● RGB Color Encoding
● Computational Indistinguishabilityand pseudorandomness
● Proactivization
● Super-resolution
Our Fourth Future Facet of Cyber-Security
No-Overhead SecuritySecurity and Performance Can Co-Exist!
Why remember passwords?Intelligent Security Systems
Fault-tolerance as a function of timeSpace for Improvement:
FasterLighter
FriendlierSimpler
FinerFitter
SmarterMore Economical
…