From 0b3bab45a370f3ac70fe81eaacdf08b8c2a8ec1f Mon Sep 17 00:00:00 2001 From: didier amyot Date: Fri, 28 Nov 2014 20:47:50 -0800 Subject: [PATCH] refactored names --- .gitignore | 5 + README.md | 2 +- makefile | 4 +- ..._visuelle.slides.html => presentation.html | 0 ...aphie_visuelle.ipynb => presentation.ipynb | 0 presentation.slides.html | 18288 ++++++++++++++++ 6 files changed, 18296 insertions(+), 3 deletions(-) rename cryptographie_visuelle.slides.html => presentation.html (100%) rename cryptographie_visuelle.ipynb => presentation.ipynb (100%) create mode 100644 presentation.slides.html diff --git a/.gitignore b/.gitignore index db4561e..020fb8e 100644 --- a/.gitignore +++ b/.gitignore @@ -52,3 +52,8 @@ docs/_build/ # PyBuilder target/ + + +# shamir specific + +env/ diff --git a/README.md b/README.md index f0afc3c..3f6619f 100644 --- a/README.md +++ b/README.md @@ -22,7 +22,7 @@ itself is rendered using [reveal.js](http://lab.hakim.se/reveal-js/). #### stating the presentation `make serve` should work! Then you will need to browse to -http://localhost:2000/cryptographie_visuelle.slides.html to see the presentation +http://localhost:2000/presentation.slides.html to see the presentation in a web browser. #### hacking the presentation diff --git a/makefile b/makefile index bccae40..0312c4b 100644 --- a/makefile +++ b/makefile @@ -1,5 +1,5 @@ pres: - env/bin/ipython3 nbconvert cryptographie_visuelle.ipynb --to slides --template output_toggle + env/bin/ipython3 nbconvert presentation.ipynb --to slides --template output_toggle test: env/bin/nosetests @@ -8,7 +8,7 @@ ipython: env/bin/ipython3 notebook serve: reveal.js - echo "browse to http://localhost:2000/cryptographie_visuelle.slides.html" + echo "browse to http://localhost:2000/presentation.slides.html" env/bin/python -m http.server 2000 env: reveal.js diff --git a/cryptographie_visuelle.slides.html b/presentation.html similarity index 100% rename from cryptographie_visuelle.slides.html rename to presentation.html diff --git a/cryptographie_visuelle.ipynb b/presentation.ipynb similarity index 100% rename from cryptographie_visuelle.ipynb rename to presentation.ipynb diff --git a/presentation.slides.html b/presentation.slides.html new file mode 100644 index 0000000..3a90671 --- /dev/null +++ b/presentation.slides.html @@ -0,0 +1,18288 @@ + + + + + + + + + + + +presentation slides + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+
+
+ +
+
+
+
+In [1]: +
+
+
+
# all the imports
+%pylab inline
+
+from visual_cryptography.visual_cryptography import (ImageLayer,
+                                                     produce_image_layer_from_real_image)
+
+
+
+pylab.rcParams['figure.figsize'] = (18.0, 8.0)
+
+ +
+
+
+ +
+ +
+
+ + +
+
+
+Populating the interactive namespace from numpy and matplotlib
+
+
+
+
+ +
+
+ +
+
+ +
+
+
+
+In [2]: +
+
+
+
noir = 1
+blanc = 0
+
+def plot_matrix(data, title="", ax=None):
+    if ax is None:
+        fig, ax = pylab.subplots()
+    ax.imshow(data, cmap=plt.cm.gray, interpolation='nearest')
+    if title:
+        ax.set_title(title)
+    ax.axis('off')
+    #pylab.show()
+
+def do_not_show_axis(ax):
+    ax.xaxis.set_major_locator(plt.NullLocator())
+    ax.yaxis.set_major_locator(plt.NullLocator())
+
+def plot_function(f, xmin=-10, xmax=10, ax=None, title=""):
+    if ax is None:
+        fig, ax = pylab.subplots()
+    X = arange(xmin, xmax, 0.1)
+    Y = [f(x) for x in X]
+    ax.plot(X, Y)
+    if title:
+        ax.set_title(title)
+
+def plot_function_in_finite_field(f, xmin=-10, xmax=10, ax=None, title=""):
+    if ax is None:
+        fig, ax = pylab.subplots()
+    X = arange(xmin, xmax, 1)
+    Y = [f(x) for x in X]
+    ax.plot(X, Y, 'r--', alpha=0.75)
+    ax.plot(X, Y, 'bo')
+    if title:
+        ax.set_title(title)
+
+
+def show_sub_pixel(matrix, ax=None, title=""):
+    """Draw Hinton diagram for visualizing a weight matrix."""
+    ax = ax or pylab.gca()
+    if title:
+        ax.set_title(title)
+
+    max_weight = 2**np.ceil(numpy.log(np.abs(matrix).max())/np.log(2))
+
+    ax.patch.set_facecolor('white')
+    ax.set_aspect('equal', 'box')
+    do_not_show_axis(ax)
+
+    for (x,y),w in np.ndenumerate(matrix):
+        if w == 0:
+            color = "white"
+        else:
+            color = "gray"
+        size =  0.8
+        rect = plt.Rectangle([y - size / 2, x - size / 2], size, size,
+                             facecolor=color, edgecolor="black")
+        ax.add_patch(rect)
+
+    ax.autoscale_view()
+    ax.invert_yaxis()
+    #pylab.show()
+
+def show_text(text, ax=None):
+    ax = ax or pylab.gca()
+    ax.xaxis.set_major_locator(plt.NullLocator())
+    ax.yaxis.set_major_locator(plt.NullLocator())
+    ax.text(0.5, 0.5,text , color='black',
+     fontsize=40,
+     #fontname='Courier',
+     horizontalalignment='center',
+     verticalalignment='center',
+     )
+    ax.axis('off')
+    
+def plot_tuple_of_pixels(pixel_1, pixel_2, axs):
+    show_text("(", axs[0])
+    show_sub_pixel(pixel_1,  ax=axs[1])
+    show_text(",", axs[2])
+    show_sub_pixel(pixel_2,  ax=axs[3])
+    show_text(")", axs[4])
+
+ +
+
+
+ +
+ +
+
+
+
+ +
+
+
+
+
+

presentation overview

+

[1] Visual cryptography

+

Encrypting information in a 100% visual way.

+

[2] Sharing a secret

+

Sharing a secret between $n$ persons such that any subset of +size $k$ can recover it.

+

[3] Password alternative

+

Using a zero knowledge proof to authenticate ourself to a third +party.

+
+
+
+
+
+ +
+
+
+
+
+

[1] Visual cryptography

+

objectives

+

Let's present the Shamir and Naor ideas to encrypt a message +in a secure way such that the decrypting does not require any computers or calculations.

+
+
+
+
+
+ +
+
+
+
+
+

Idea

+

The big idea is to encrypt an image on two separate transparents. +When the two transparents are stack togheter, the original image +can be recover.

+
+
+
+ +
+
+
+
+
+

First transparent

+
+
+
+ +
+
+
+
+In [3]: +
+
+
+
img = produce_image_layer_from_real_image("image.png")
+shares = img.produce_two_shares_from_image()
+plot_matrix(shares[0], title='first transparent')
+
+ +
+
+
+ +
+ +
+
+ + +
+ + +
+ +
+ +
+ +
+
+ +
+
+ +
+
+
+
+
+

Second transparent

+
+
+
+ +
+
+
+
+In [4]: +
+
+
+
plot_matrix(shares[1], title='second transparent')
+
+ +
+
+
+ +
+ +
+
+ + +
+ + +
+ +
+ +
+ +
+
+ +
+
+ +
+
+
+
+
+

Stacking the two transparents togheter

+
+
+
+ +
+
+
+
+In [5]: +
+
+
+
sum_of_the_shares = shares[0] * shares[1]  # note that matplotlib associates 0 to black and 1 to white
+plot_matrix(sum_of_the_shares, title="both transparents")
+
+ +
+
+
+ +
+ +
+
+ + +
+ + +
+ +
+ +
+ +
+
+ +
+ +
+
+
+
+
+

remarks

+
    +

  • The person that creates encrypt the message is called the dealer

    +
    • +

  • One of the transparent can be called the cypher and the other the key.

    +
    • +

  • A crytosystem is said to be secure if, without the key, it impossible to +know the original message from the cypher.

    +
    • +
+
+
+
+
+
+ +
+
+
+
+
+

Let's look at what happend

+
+
+
+ +
+
+
+
+
+

We started by an image

+

This image is said as the message

+

image initiale

+
+
+
+ +
+
+
+
+
+

We splitted the image into many pixels

+

pixel decomposition of the original image

+
+
+
+ +
+
+
+
+
+

constructe transparent methodology

+

We construct each transparent in a pixel by pixel fashion.

+
+
+
+ +
+
+
+
+In [6]: +
+
+
+
fig, (ax0, ax1, ax2 ) = plt.subplots(ncols=3)
+
+img=matplotlib.image.imread('image.png')
+do_not_show_axis(ax0)
+ax0.imshow(img)
+
+show_sub_pixel([[blanc]*10]*10, ax=ax1, title="transparent 1")
+show_sub_pixel([[blanc]*10]*10, ax=ax2, title="transparent 2")
+
+ +
+
+
+ +
+ +
+
+ + +
+
+
+-c:43: RuntimeWarning: divide by zero encountered in log
+
+
+
+
+ +
+ + +
+ +
+ +
+ +
+
+ +
+
+ +
+
+
+
+
+

Encrypting each pixels

+

To encrypt a pixel, we'll decompose it in $m$ sub-pixel. Each sub-pixel can be black or white.

+
    +

  • The humain eye will approximate the $m$ sub-pixel in a pixel

    +
    • +

  • If there is enought black sub-pixel, the eye will see a black pixel

    +
    • +

  • If there is not enought of black sub-pixel, the eye will see a white pixel

    +
    • +
+
+
+
+ +
+
+
+
+In [7]: +
+
+
+
fig, (ax0, ax1, ax2 ) = plt.subplots(ncols=3)
+
+show_sub_pixel([[noir, noir, noir],
+                [noir, noir, noir], 
+                [noir, noir, noir]],
+               ax=ax0,
+               title="a black pixel")
+
+show_sub_pixel([[blanc, noir, noir],
+                [noir, noir, blanc], 
+                [blanc, noir, noir]],
+               ax=ax1,
+               title="a black pixel")
+
+show_sub_pixel([[blanc, blanc, noir],
+                [blanc, noir, blanc], 
+                [blanc, noir, blanc]],
+               ax=ax2,
+               title="a white pixel")
+
+ +
+
+
+ +
+ +
+
+ + +
+ + +
+ +
+ +
+ +
+
+ +
+
+ +
+
+
+
+
+

techinical objectives

+

To help the humain, we need the black to be as dark as possible and the white to be +as bright as possible

+

black pixel

+

A pixel is said to be black if it is made of at least $d \leq m$ black sub-pixels

+

white pixel

+

A pixel is said to be white if it is made of no more than $d - \alpha m$ black sub-pixels

+
+
+
+ +
+
+
+
+
+

remarks

+
    +

  • $m$ is the number of sub-pixels in a pixel

    +
    • +

  • Bigger $d$ is, darker the blacks are

    +
    • +

  • Bigger $\alpha$ is, brighter the whites are.

    +
    • +

  • $\alpha$ represent here a "distance" between the white and black. Greather this distance +will be easier it will be to distinguist between the blacks and whites

    +
    • +
+
+
+
+
+ +
+
+
+
+In [8]: +
+
+
+
import matplotlib as mpl
+
+fig, ax = pylab.subplots()
+
+cmap = mpl.cm.gray_r
+norm = mpl.colors.Normalize(vmin=5, vmax=10)
+cb = mpl.colorbar.ColorbarBase(ax, cmap=cmap,
+                                   norm=norm,
+                                   orientation='horizontal')
+
+ax.set_axis_off()
+ax.text(0.9, 0.5, 'black',
+        horizontalalignment='center',
+        verticalalignment='center',
+        rotation='vertical',
+        size="20",
+        color="white",
+        transform=ax.transAxes)
+
+ax.text(0.1, 0.5, 'white',
+        horizontalalignment='center',
+        verticalalignment='center',
+        rotation='vertical',
+        size="20",
+        color="black",
+        transform=ax.transAxes)
+pylab.show()
+
+ +
+
+
+ +
+ +
+
+ + +
+ + +
+ +
+ +
+ +
+
+ +
+ +
+
+
+
+
+

encryption

+

In a way or an other, for each pixel we figured out sub-pixel to place on each transparent +such that.

+
    +

  • when stacked, they form the the original image

    +
    • +

  • with only one transparent, it is impossible to know what is the original image

    +
    • +
+
+
+
+
+
+
+
+In [9]: +
+
+
+
fig, (ax0, ax1, ax2 ) = plt.subplots(ncols=3)
+
+plot_matrix(shares[0], title='first transparent', ax=ax0)
+plot_matrix(shares[1], title='second transparent', ax=ax1)
+plot_matrix(shares[1] * shares[0], title='stacked transparents', ax=ax2)
+
+ +
+
+
+ +
+ +
+
+ + +
+ + +
+ +
+ +
+ +
+
+ +
+
+
+ +
+
+
+
+
+

Some formalization

+
+
+
+ +
+
+
+
+
+

Definition of a pixel structure

+

We encode a pixel in an array of size $m$, $[ p_1, p_2, \dots, p_m ]$

+
    +

  • where $i$ represents a specific sub-pixel position

    +
    • +

  • the $i^th$ sub-pixel is black is $p_i$ is $1$ and white if $p_i$ is $0$

    +
    • +
+
+
+
+ +
+
+
+
+In [10]: +
+
+
+
show_sub_pixel([[noir, blanc, noir],
+                [blanc, noir, blanc], 
+                [blanc, blanc, blanc]], title="[1 0 1 0 1 0 0 0 0]")
+
+ +
+
+
+ +
+ +
+
+ + +
+ + +
+ +
+ +
+ +
+
+ +
+
+ +
+
+
+
+
+

transparent superposition

+

Consequently the transparent superposition can be seen as componentwise or operation

+
   [1 0 1 0 ]
++  [1 1 0 0 ]
+-----------------------
+   [1 1 1 0 ]
+
+
+
+
+
+
+
+
+In [11]: +
+
+
+
fig, (ax0, ax1, ax2, ax3, ax4 ) = plt.subplots(ncols=5)
+show_sub_pixel([[noir, blanc],
+                [noir, blanc]], title="[1 0 1 0]", ax=ax0)
+
+show_text("+", ax1)
+
+show_sub_pixel([[noir, noir],
+                [blanc, blanc]], title="[1 1 0 0]", ax=ax2)
+
+show_text("=", ax3)
+
+show_sub_pixel([[noir, noir],
+                [noir, blanc]], title="[1 1 1 0]", ax=ax4)
+
+ +
+
+
+ +
+ +
+
+ + +
+ + +
+ +
+ +
+ +
+
+ +
+
+
+ +
+
+
+
+
+

encryption...

+

How can we encode a pixel $P$ (black or white) in two pixels $Q_1$ $Q_2$ such that...

+
    +

  1. $Q_1 + Q_2 \sim P$

    +
    2. +

  2. Without having access to $Q_1$ and $Q_2$, we grain no knowledge on $P$

    +
    3. +
+

$$ + Prob(\text{P is white} | Q_i) = Prob(\text{P is black} | Q_i) +$$

+
+
+
+ +
+
+
+
+In [11]: +
+
+
+
 
+
+ +
+
+
+ +
+ +
+
+ +
+
+
+
+
+

$A \sim B$ if $A$ is the same colour as $B$

+
+
+
+
+ +
+
+
+
+
+

solution

+

We create two sets

+

$W = \{ (r_1, l_1) , (r_2, l_2), \dots, (r_k, l_k) \}$

+

$K = \{ (g_1, d_1) , (g_2, d_2), \dots, (g_k, d_k) \}$

+

such that...

+
    +

  1. $r_i + l_i$ is white

    +
    2. +

  2. $g_i + d_i$ is black

    +
    3. +

  3. The cardinality of $x$ in the multiset $\{r_1, l_1, \dots r_k, l_k\}$ is +the same in the multiset $\{g_1, d_1, \dots g_k, d_k\}$.

    +
    4. +
+
+
+
+ +
+
+
+
+
+

A working example

+
+
+
+ +
+
+
+
+In [12]: +
+
+
+
fig, axs = plt.subplots(ncols=14)
+
+pixel = lambda a, b, c, d : [[a, b], [c, d]]
+w, b = blanc, noir
+
+show_text("white={ ", axs[0])
+show_text("  ", axs[1])
+plot_tuple_of_pixels(pixel(w, b, w, b), pixel(w, b, w, b), axs[2:])
+show_text(",", axs[7])
+plot_tuple_of_pixels(pixel(b, w, b, w), pixel(b, w, b, w), axs[8:])
+show_text("}", axs[13])
+
+ +
+
+
+ +
+ +
+
+ + +
+ + +
+ +
+ +
+ +
+
+ +
+
+ +
+
+
+
+In [13]: +
+
+
+
fig, axs = plt.subplots(ncols=14)
+
+pixel = lambda a, b, c, d : [[a, b], [c, d]]
+w, b = blanc, noir
+
+show_text("black={ ", axs[0])
+show_text("  ", axs[1])
+plot_tuple_of_pixels(pixel(w, b, w, b), pixel(b, w, b, w), axs[2:])
+show_text(",", axs[7])
+plot_tuple_of_pixels(pixel(b, w, b, w), pixel(w, b, w, b), axs[8:])
+show_text("}", axs[13])
+
+ +
+
+
+ +
+ +
+
+ + +
+ + +
+ +
+ +
+ +
+
+ +
+
+ +
+
+
+
+
+

An other working example

+
+
+
+ +
+
+
+
+In [14]: +
+
+
+
fig, axs = plt.subplots(ncols=14)
+
+pixel = lambda a, b, c, d : [[a, b], [c, d]]
+w, b = blanc, noir
+
+show_text("white={ ", axs[0])
+show_text("  ", axs[1])
+plot_tuple_of_pixels(pixel(w, b, b, w), pixel(w, b, b, w), axs[2:])
+show_text(",", axs[7])
+plot_tuple_of_pixels(pixel(b, w, w, b), pixel(b, w, w, b), axs[8:])
+show_text("}", axs[13])
+
+ +
+
+
+ +
+ +
+
+ + +
+ + +
+ +
+ +
+ +
+
+ +
+
+ +
+
+
+
+In [15]: +
+
+
+
fig, axs = plt.subplots(ncols=14)
+
+pixel = lambda a, b, c, d : [[a, b], [c, d]]
+w, b = blanc, noir
+
+show_text("black={ ", axs[0])
+show_text("  ", axs[1])
+plot_tuple_of_pixels(pixel(w, b, b, w), pixel(b, w, w, b), axs[2:])
+show_text(",", axs[7])
+plot_tuple_of_pixels(pixel(b, w, w, b), pixel(w, b, b, w), axs[8:])
+show_text("}", axs[13])
+
+ +
+
+
+ +
+ +
+
+ + +
+ + +
+ +
+ +
+ +
+
+ +
+
+ +
+
+
+
+
+

A simpler working example

+
+
+
+ +
+
+
+
+In [16]: +
+
+
+
fig, axs = plt.subplots(ncols=14)
+
+pixel = lambda a, b : [[a, b]]
+w, b = blanc, noir
+
+show_text("white={ ", axs[0])
+show_text("  ", axs[1])
+plot_tuple_of_pixels(pixel(w, b), pixel(w, b), axs[2:])
+show_text(",", axs[7])
+plot_tuple_of_pixels(pixel(b, w), pixel(b, w), axs[8:])
+show_text("}", axs[13])
+
+ +
+
+
+ +
+ +
+
+ + +
+ + +
+ +
+ +
+ +
+
+ +
+
+ +
+
+
+
+In [17]: +
+
+
+
fig, axs = plt.subplots(ncols=14)
+
+pixel = lambda a, b : [[a, b]]
+w, b = blanc, noir
+
+show_text("black={ ", axs[0])
+show_text("  ", axs[1])
+plot_tuple_of_pixels(pixel(w, b), pixel(b, w), axs[2:])
+show_text(",", axs[7])
+plot_tuple_of_pixels(pixel(b, w), pixel(w, b), axs[8:])
+show_text("}", axs[13])
+
+ +
+
+
+ +
+ +
+
+ + +
+ + +
+ +
+ +
+ +
+
+ +
+
+
+
+ +
+
+
+
+
+

A possible attack?

+
+
+
+ +
+
+
+
+
+

Yes!

+
+
+
+
+ +
+
+
+
+
+

the last person that shows its transparent can cheat.

+

By crafting its own transparent, knowing the other transparent, +a cheater could show whatever he wants as a results

+
+
+
+ +
+
+
+
+In [18]: +
+
+
+
cheated = produce_image_layer_from_real_image("cheatedimage.png")
+cheated_share = cheated.produce_cheated_image_from_other_share(shares[0])
+
+plot_matrix(cheated_share , title='crafted transparent')
+
+savefig("crafted_transparen.pdf")
+
+ +
+
+
+ +
+ +
+
+ + +
+ + +
+ +
+ +
+ +
+
+ +
+
+ +
+
+
+
+In [19]: +
+
+
+
plot_matrix(cheated_share * shares[0], title='forge results')
+
+ +
+
+
+ +
+ +
+
+ + +
+ + +
+ +
+ +
+ +
+
+ +
+
+
+ +
+
+
+
+
+

[2] Sharing a secret

+

objectives

+

Let's present Shamir's ideas of secret sharing.

+
+
+
+ +
+
+
+
+
+

the problem

+

Alice wants to share his swiss bank account number with Bob TheFirst, Bob TheSecond, Bob TheThird,... Bob TheNth such that...

+
    +

  1. If any $k$ Bobs comes togheter they need to be able to recover the bank account number

    +
    2. +

  2. If any less that $k$ Bobs comes togheter they need to have no idea whatsoever about the bank account number

    +
    3. +
+
                 ***********
+               ***** ***********
+            ** ****** *** ********
+           ****  ******  ** *******
+           ***     ******* ** ******
+           ***       **        *  **
+            *|/------  -------\ ** *
+             |       |=|       :===**
+              |  O  |   | O   |  }|*
+               |---- |   ----  |  |*
+               |    |___       |\/
+               |              |
+               \   -----     |
+                \           |
+                  -__ -- -/
+
+
+
+
+
+ +
+
+
+
+
+

shamir solution: use polynomials!

+
+
+
+ +
+
+
+
+
+

definition

+

A polynomial is a function that can be written as

+

$$ + a_0 + a_1 \cdot x^1 + a_2 \cdot x^2 + \dots + a_n \cdot x^n +$$

+
+
+
+ +
+
+
+
+In [20]: +
+
+
+
fig, (ax0, ax1, ax2) = plt.subplots(ncols=3)
+plot_function(lambda x : 2 * x + 1, title="$2 \cdot x + 1$", ax=ax0)
+plot_function(lambda x : 2 * x**2 + 1, title="$2 \cdot x^2 + 1$", ax=ax1)
+plot_function(lambda x : 2 * x**3 - 2 * x**2 + 1, title="$2 \cdot x^3 - 2 \cdot x^2  + 1$", ax=ax2)
+
+ +
+
+
+ +
+ +
+
+ + +
+ + +
+ +
+ +
+ +
+
+ +
+
+ +
+
+
+
+
+

important feature of polynomials

+

Any $n + 1$ points define an unique polynomials of degre $n$.

+
+
+
+ +
+
+
+
+In [21]: +
+
+
+
fig, (ax0, ax1, ax2) = plt.subplots(ncols=3)
+
+p = lambda x : 2 * x + 1
+plot_function(p, title="$2 \cdot x + 1$", ax=ax0)
+ax0.plot([-7, 7]  , [p(-7), p(7)], "ro")
+
+p = lambda x : 2 * x**2 + 1
+plot_function(p, title="$2 \cdot x^2 + 1$", ax=ax1)
+ax1.plot([-7, 0, 7], [p(-7), p(0), p(7)], "ro")
+
+
+
+p = lambda x : 2 * x**3 - 2 * x**2 + 1
+plot_function(p, title="$2 \cdot x^3 - 2 \cdot x^2  + 1$", ax=ax2)
+ax2.plot([-7, -3, 3, 7], [p(-7), p(-3), p(3), p(7)], "ro")
+show()
+
+ +
+
+
+ +
+ +
+
+ + +
+ + +
+ +
+ +
+ +
+
+ +
+
+ +
+
+
+
+
+

Similarly,

+

by $n$ points pass an infinite number of polynomials of degree $n$

+
+
+
+ +
+
+
+
+In [28]: +
+
+
+
fig, ax = plt.subplots()
+
+b = 0
+d = 1
+c = lambda a : -100 - 7**2 * a
+
+P = lambda a : (lambda x: a * x**3 + b * x**2 + x * c(a) + d)
+
+for i in range(-12, 12, 3):
+    plot_function(P(i), ax=ax)
+
+
+p = P(1)
+ax.plot([-7, 0, 7]  , [p(-7), p(0), p(7)], "ro")
+ax.set_title("Polynomials passing through $(-7, 701), (0, 1), (7, -699)$")
+fig.show()
+
+ +
+
+
+ +
+ +
+
+ + +
+ + +
+ +
+ +
+ +
+
+ +
+
+ +
+
+
+
+
+

Shamir's secret sharing

+
    +
  • Alice needs to create a random polynomial of degre $k-1$ such that $a_0$ is the +secret to share.
    • +
+

$$ P(x) = a_0 + a_1 \cdot x^1 + a_2 \cdot x^2 + \dots + a_{k-1}\cdot x^{x-1} $$

+
    +
  • Alice gives to each Bob TheIth the couple $(i, P(i))$
    • +
+
+
+
+ +
+
+
+
+
+

secret recovery

+

If $K$ bob comes togheter, they can figure out the secret polynomial $P(x)$ and compute $P(0)$

+
+
+
+
+
+
+
+
+
+

interesting facts

+
    +
  • the number $n$ needs not to be known at first. (Additional bobs can +come and join the party!)
    • +
+
    +
  • the number $k$ is fixed forever
    • +
+
    +
  • the fact that we evaluate $P(x)$ at $0$ helps tremendously in +the algebraic resolution of the problems
    • +
+
    +
  • the Shamir's secret sharing is at the base of almost every "threshold" +cryptography
    • +
+
+
+
+
+
+ +
+
+
+
+
+

small example to see if everything works

+

Peter wants to share between Wolf and Didier the +ACS's credit card: 5243 9021 9129 1828.

+
+
+
+ +
+
+
+
+In [23]: +
+
+
+
p = lambda x : 5243902191291828 + 7873787349 * x + 7893478934 * x ** 2
+credit_card_number = 5243902191291828
+wolf_secret = p(1) # keyboard random number
+didier_secret = p(2)
+print(wolf_secret)
+print(didier_secret)
+
+ +
+
+
+ +
+ +
+
+ + +
+
+
+5243917958558111
+5243949512782262
+
+
+
+
+ +
+
+ +
+
+ +
+
+
+
+
+

step 1

+

Peter choose the bellow polynomials because he likes it very much

+

$$P(X) = 5243902191291828 + 7873787349\cdot x + 7893478934\cdot x^2$$

+
+
+
+
+ +
+
+
+
+
+

step 2

+
    +
  • Peter gives $(1, 5243917958558111)$ to Wolf
    • +
  • Peter gives $(2, 5243949512782262)$ to Didier
    • +
+
+
+
+
+ +
+
+
+
+
+

As all Canadian can expect...

+

Didier will try to figure out the credit card number to buy a +truck load of maple sirup.

+
+
+
+ +
+
+
+
+
+

Can Didier acheve its goal?

+
+
+
+
+ +
+
+
+
+
+

Let's resume what Didier knows

+
    +

  1. He knows that he is looking for a number $a_0$ of 12 digits

    +
    2. +

  2. $a_0$ is positive

    +
    3. +

  3. $a_0$ is an integer

    +
    4. +
+
+
+
+
+ +
+
+
+
+
+

But if didier does a little bit of algebra...

+
+
+
+ +
+
+
+
+
+

... +$$P(x) = a_0 + a_1 \cdot x + a_2 \cdot x^2 $$ +$$5243949512782262 = a_0 + a_1 \cdot 2 + a_2 \cdot 4 $$ +$$a_0 = 5243949512782262 - a_1 \cdot 2 - a_2 \cdot 4$$ +$$a_0 = 5243949512782262 - 2\cdot(a_1 \cdot - 2 \cdot a_2)$$ +$$a_0 = 5243949512782262 - \text{even number}$$

+
+
+
+
+ +
+
+
+
+
+

Hence...

+
    +

  • Didier knows the credit card number is even

    +
    • +

  • With the help of EC2 Didier can find the solution in a relative small amount of time.

    +
    • +
+
+
+
+ +
+
+
+
+
+

What can we do to avoid such situation?

+
+
+
+ +
+
+
+
+
+
    +

  1. We could process the original message before wharing it

    +

    $$\underbrace{xxxxxxxxxxxxxxxxxxxxxxxxxxxxxx}_\text{very random number}\underbrace{5243902191291828}_\text{the credit card number}$$

    +
    2. +
+
+
+
+
+ +
+
+
+
+
+
    +

  1. We could work in a more appropriate field

    +

    $$\mathbb{Z}/p\mathbb{Z}$$

    +
    2. +
+
+
+
+
+ +
+
+
+
+
+

What is $\mathbb{Z}/p\mathbb{Z}$ ?

+
+
+
+ +
+
+
+
+
+
    +
  • $p$ is (very large) prime
    • +
+
    +
  • $\mathbb{Z}/p\mathbb{Z}$ is the set of all the integers between $0$ and $p-1$
    • +
+
    +
  • we can add two elements of $\mathbb{Z}/p\mathbb{Z}$ as usual. If the result +is larger than $p$ we loop using the modulo operation
    • +
+
    +
  • we can multiply two elements of $\mathbb{Z}/p\mathbb{Z}$ as usual. If the result +is larger than $p$ we loop using the modulo operation
    • +
+
+
+
+
+ +
+
+
+
+
+

Uber important things

+
    +
  • Almost everything you know about the "numbers" is still +true in $\mathbb{Z}/p\mathbb{Z}$
    • +
+
    +
  • In particular, each element has a multiplicative inverse
    • +
+
+
+
+
+ +
+
+
+
+
+

example $\mathbb{Z}/7\mathbb{Z}$

+
+
+
+ +
+
+
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
x0123456
00000000
10123456
20246135
30362514
40415263
50531642
60654321
+
+
+
+
+ +
+
+
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+0123456
00123456
11234560
22345601
33456012
44560123
55601234
66012345
+
+
+
+
+
+
+ +
+
+
+
+
+

back to polyominals... (but int $\mathbb{Z}/p\mathbb{Z}$)

+
+
+
+ +
+
+
+
+In [24]: +
+
+
+
fig, (ax0, ax1, ax2) = plt.subplots(ncols=3)
+plot_function_in_finite_field(lambda x : (2 * x + 1) % 7, title="$2 \cdot x + 1$ mod 7", ax=ax0)
+plot_function_in_finite_field(lambda x : (2 * x**2 + 1) % 7, title="$2 \cdot x^2 + 1$ mod 7", ax=ax1)
+plot_function_in_finite_field(lambda x : (2 * x**3 - 2 * x**2 + 1) % 7, title="$2 \cdot x^3 - 2 \cdot x^2  + 1$ mod 7", ax=ax2)
+
+ +
+
+
+ +
+ +
+
+ + +
+ + +
+ +
+ +
+ +
+
+ +
+
+ +
+
+
+
+
+

The main two polyominals facts are still (almost) true

+
+
+
+ +
+
+
+
+
+

Any $n + 1$ points define an unique polynomial of degre $n$.

+
+
+
+ +
+
+
+
+In [25]: +
+
+
+
fig, ax = plt.subplots()
+f = lambda x : (2 * x**3 - 2 * x**2 + 1) % 7
+plot_function_in_finite_field(f, title="$2 \cdot x^3 - 2 \cdot x^2  + 1 mod 7$", ax=ax)
+ax.plot([-7, 0, 7], [f(-7), f(0), f(7)], 'rD')
+fig.show()
+
+ +
+
+
+ +
+ +
+
+ + +
+ + +
+ +
+ +
+ +
+
+ +
+
+ +
+
+
+
+
+

By $n$ points pass $p$ polyomials of degree $n$.

+
+
+
+ +
+
+
+
+In [29]: +
+
+
+
fig, ax = plt.subplots()
+
+b = 0
+d = 1
+c = lambda a : -100 - 7**2 * a
+
+P = lambda a : (lambda x: (a * x**3 + b * x**2 + x * c(a) + d) % 7)
+
+for i in range(-12, 12, 3):
+    plot_function_in_finite_field(P(i), ax=ax)
+
+
+p = P(1)
+ax.plot([-7, 0, 7]  , [p(-7), p(0), p(7)], "ro")
+ax.set_title("Polynomials passing through $(-7, 1), (0, 1), (7, 1)$")
+fig.show()
+
+ +
+
+
+ +
+ +
+
+ + +
+ + +
+ +
+ +
+ +
+
+ +
+
+ +
+
+
+
+
+

back to Shamir's secret sharing

+
+
+
+ +
+
+
+
+
+

If peter would have choosen polynomials in $\mathbb{Z}/p\mathbb{Z}$ with $p$ big enough...

+
    +

  1. Didier could not have easely discarted some numbers

    +
    2. +

  2. For Didier, a large $p$ in infinite even with the help of $aws$

    +
    3. +
+
+
+
+
+
+
+ +
+
+
+
+
+

[3] Password alternative

+

The objective of this sections is to present the idea of the +article how to proof yourself, +an article publish by Fiat and Shamir in the year of grace 1987.

+
+
+
+ +
+
+
+
+
+

Objective

+

The objective is to find a way to allow Alice to authenticate to Bob such that...

+
    +

  1. Alice can authenticate

    +
    2. +

  2. Bob is sure that the Alice is really Alice

    +
    3. +

  3. Bob cannot copy the credentials of alice in any way.

    +
    4. +
+
+
+
+ +
+
+
+
+
+

in the contect of a zero-knoledge proof...

+
    +

  1. Completness

    +
    2. +

  2. Soundness

    +
    3. +

  3. Zero-knowledge

    +
    4. +
+
+
+
+
+ +
+
+
+
+
+

how can we do that?

+
    +

  1. Bob and Alice exchange some information while they know they are talking to the each other (sign up)

    +
    2. +

  2. In that exchange, Alice will tell Bob that she knows something, proof without giving Bob or anyone else +any factual proof.

    +
    3. +

  3. Each time Alice will authenticate, Alice will provide enough information to Bob to demonstrate that she knows the +information but without giving any factual proofs.

    +
    4. +
+
+
+
+
+
+ +
+
+
+
+
+

quadratic residue

+
+
+
+ +
+
+
+
+
+

There are some problems that are easy to solve in $\mathbb{R}$ but very hard to solve in $\mathbb{Z}/n\mathbb{Z}$

+
+
+
+
+ +
+
+
+
+
+

quadratic residue

+
    +

  • The quandratric residue of $x$ in $\mathbb{Z}/n\mathbb{Z}$ is an +element $y$ such that $x^2 = y$

    +
    • +

  • We say that $y$ is a quadratic residue if there exists $x$ such +that $x^2 = y$

    +
    • +
+
+
+
+
+ +
+
+
+
+
+

facts

+
    +

  • not every elements are quadratic residue

    +
    • +

  • It is hard to know if a number is a quadratic residue

    +
    • +

  • It is easy to find a quadratic residue: just take a random +$r$ and compute $r^2$

    +
    • +
+
+
+
+
+
+
+ +
+
+
+
+
+

Proving ourselves with quadratic residues...

+
+
+
+ +
+
+
+
+
+

idea

+

The idea is that Alice will demonstrate to Bob that she knows that a certain element $x$ is a quadratic residue +without giving $\omega$ such that $\omega ^2 = x$

+
+
+
+ +
+
+
+
+
+

protocol...

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
AliceBob
chose a random $r$
sends $a = r^2$
send challenge 0 or 1 at random
if challenge is 1 returns raccept if $r^2 = a$
if challenge is 0 returns $r\cdot\omega$accept is $(r\cdot\omega)^2 = a \cdot x$
+
+
+
+ +
+
+
+
+
+
    +

  • completeness: + If Alice plays the game, she will be to proof that she is herself with probability 1

    +
    • +

  • soundness: + Bob as a probablylity $1/2$ to catch a cheeter

    +
    • +

  • zero-knowledge: + Proof by intimidation

    +
    • +
+
+
+
+
+
+
+
+In []: +
+
+
+
 
+
+ +
+
+
+ +
+ +
+
+
+ + + + + + + + + + + + + + + + + + +