Crypto 2018

August 19-23, 2018

Affiliated events

August 17-19, 2018

Santa Barbara, USA

Affiliated Event: MathCrypt 2018 (August 19)

MathCrypt aims to provide a forum for exchanging ideas on new mathematical assumptions and attacks in cryptography, and, to encourage and attract new researchers to work in the area of mathematical cryptography. Its scope includes, but is not limited to:

  • Introducing new assumptions which can be used to construct or improve cryptographic schemes.
  • Proposing new attacks on cryptographic assumptions.
  • Implementation improvements for cryptographic schemes and attacks. Potential Participants: Mathematicians, Cryptographers, Theorists, Implementers

Organizers

  • Jintai Ding (University of Cincinnati)
  • Jung Hee Cheon (Seoul National University)
  • Kristin Lauter (Microsoft Research)

Paper submissions

  • Camera ready form(Journal version) due: September 1st, 2018.

Accepted Papers

1. Self-dual DeepBKZ for finding short lattice vectors

Masaya Yasuda(Institute of Mathematics for Industry, Kyushu University)

2. Designing Efficient Dyadic Operations for Cryptographic Applications

Gustavo Banegas(Technische Universiteit Eindhoven); Paulo S. L. M. Barreto(UW Tacoma); Edoardo Persichetti(Florida Atlantic University); Paolo Santini(Universita' Politecnica delle Marche)

3. Characterizing overstretched NTRU attacks

Gabrielle De Micheli(University of Pennsylvania); Nadia Heninger(University of Pennsylvania); Barak Shani(University of Pennsylvania)

4. Multiparty Non-Interactive Key Exchange and More from Isogenies on Elliptic Curves

Dan Boneh(Stanford University); Darren Glass(Gettysburg College); Daniel Krashen(University of Georgia Athens); Kristin Lauter(Microsoft Research); Shahed Sharif(California State University San Marcos); Alice Silverberg(University of California Irvine); Mehdi Tibouchi(NTT Corporation); Mark Zhandry(Princeton University)

5. Recovering Secrets From Prefix-Dependent Leakage

Houda Ferradi(NTT Corporation); Rémi Géraud(École normale supérieure); Sylvain Guilley(Telecom ParisTech); David Naccache(École normale supérieure); Mehdi Tibouchi(NTT Corporation)

6. New Techniques for SIDH-based NIKE

David Urbanik(University of Waterloo); David Jao(University of Waterloo)

7. Quasi-subfield polynomials and the Elliptic Curve Discrete Logarithm Problem

Ming-Deh A. Huang(University of Southern California); Michiel Kosters(University of California, Irvine); Christophe Petit(University of Birmingham); Sze Ling Yeo(Institute for Infocomm Research (I2R) and Nanyang Technical University); Yang Yun

8. A signature scheme from the finite fields isomorphism problem

Jeffrey Hoffstein(Brown University); Joseph H. Silverman(Brown University); William Whyte(OnBoard Security); Zhenfei Zhang(OnBoard Security)

9. Efficiently processing complex-valued data in homomorphic encryption

Carl Bootland(KU Leuven); Wouter Castryck(KU Leuven and UGent); Ilia Iliashenko(KU Leuven); Frederik Vercauteren(KU Leuven)

10. A polynomial quantum space attack on CRS and CSIDH

David Jao(University of Waterloo); Jason LeGrow(University of Waterloo); Christopher Leonardi(University of Waterloo); Luiz Ruiz-Lopez(University of Waterloo)

11. Flattening NTRU for evaluation key free homomorphic encryption

Yarkin Doröz(New Jersey Institute of Technology)

After revised, the final papers will be linked.

Program

We are planning 14 accepted presentations.

Talks will take place in UCEN Harbor Room.

Program Committee

  • Martin Albrecht
  • Lily Chen
  • Chen-Mou Cheng
  • Jung Hee Cheon
  • Jintai Ding
  • Pierre-Alain Fouque
  • David Hyeon
  • Sorina Ionica
  • Antoine Joux
  • Kristin Lauter
  • Hyangsook Lee
  • Arjen Lenstra
  • Dongdai Lin
  • Alexander May
  • Alfred Menezes
  • Michele Mosca
  • Christophe Petit
  • Martin Roetheler
  • Joachim Rosenthal
  • San Ling
  • Igor Shparlinski
  • Joseph Silverman
  • Fang Song
  • Katherine Stange
  • Damien Stehle
  • Ron Steinfeld
  • Rainer Steinwandt
  • Tsuyoshi Takagi
  • Mehdi Tibouchi
  • Vinod Vaikuntanathan
  • Aaram Yun

Contact

For any information, please contact us.