[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

Zero-Knowledge Made Easy so It Won’t Make You Dizzy

(A Tale of Transaction Put in Verse About an Illicit Kind of Commerce)

  • Conference paper
  • First Online:
Security and Cryptography for Networks (SCN 2016)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 9841))

Included in the following conference series:

  • 1102 Accesses

Abstract

For any research paper, as all the authors know

An abstract is required to keep the proper flow

An abstract is a lure that must be appetizing

It’s typically stuffed with shameless aggrandizing

Which brings us to the subject of our seminal result

Its impact on the Zeitgeist will alter the Gestalt

This noble work is prompted by dominance of prose

The reason crypto papers make readers comatose

This paper makes an effort to change the status quo

By showing that crypto poetry is another way to go

Translated from the Slobonian by G. Tsudik, gts@ics.uci.edu.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 35.99
Price includes VAT (United Kingdom)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 44.99
Price includes VAT (United Kingdom)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    And if you’re a godless atheist

    Assume that p was picked by NIST

References

  1. Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186–194. Springer, Heidelberg (1987)

    Chapter  Google Scholar 

  2. Quisquater, J.-J., Guillou, L.C., Berson, T.A.: How to explain zero-knowledge protocols to your children. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 628–631. Springer, Heidelberg (1990)

    Google Scholar 

  3. Tate, J.: The Arithmetic of Elliptic Curves. Inventiones Math. 23(3–4), 179–206 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  4. Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inf. Theor. 22(6), 644–654 (1976)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Trotta Gnam .

Editor information

Editors and Affiliations

Appendix A: A Poetical Revenge on Diffie-Hellman Key Exchange

Appendix A: A Poetical Revenge on Diffie-Hellman Key Exchange

1.1 1. Introduction and Motivation

Teaching cryptography can be so boring

That one can hear students snoring

To verify this claim and see

Try introducing them to public key

Before we delve into this lecture

We need to first make a conjecture

Perhaps the boredom is caused

By dominance of sleep-inducing prose

We thus attempt to keep the audience alert

By rhymes to which we protocols convert

We start with Diffie-Hellman protocol [4]

Which is by far the simplest one of all

In this description, it isn’t very terse

Since it’s presented entirely in verse

NOTE: As we forward bravely plow

The rhyming tempo changes now

1.2 2. The Protocol

figure e

Before our Earth was ever trod

A large prime p was picked by GodFootnote 1

NOTE: In the protocol you’ll see

All computations are mod p

Then, a generator g was chosen

And thereafter both were frozen

figure f

Alice – one of fairer sex

Computes g to random X

Bob – a sketchy kind of guy

Raises g to chosen Y

Clock synchronization loose

They exchange the residues

Not to spoil all the fun \(\ldots \)

But, that’s the end of round one

Alice, with her secret, next

Raises g \(^Y\) to the X

Feeling just a little high

Bob computes g \(^X\) to the Y

Now for both the time is ripe

To bootstrap a secure pipe

1.3 3. Correctness

To see that Diffie-Hellman works

Even between two total dorks

Consider that both Bob and Alice

Wind up computing equal values

1.4 4. Security

figure g

A passive eavesdropper can see

How they obtain the shared key

But even best computing toys

Can’t help distinguish it from noise

figure h

Alas this claim’s no longer true

When adversary changes hue

When Eve adopts an active role

We’re left with a broken protocol

She distracts Alice by playing fiddle

While fooling Bob with man-in-the-middle

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Gnam, T. (2016). Zero-Knowledge Made Easy so It Won’t Make You Dizzy. In: Zikas, V., De Prisco, R. (eds) Security and Cryptography for Networks. SCN 2016. Lecture Notes in Computer Science(), vol 9841. Springer, Cham. https://doi.org/10.1007/978-3-319-44618-9_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-44618-9_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-44617-2

  • Online ISBN: 978-3-319-44618-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics