会议信息
Eurocrypt 2026: International Conference on the Theory and Applications of Cryptographic Techniques
https://eurocrypt.iacr.org/2026/
截稿日期:
2025-10-02
通知日期:
2026-01-29
会议日期:
2026-05-10
会议地点:
Rome, Italy
届数:
45
CCF: a   CORE: a*   QUALIS: a1   浏览: 94712   关注: 72   参加: 3

征稿
Eurocrypt 2026, the 38th annual international conference on the theory and applications of cryptographic techniques, will take place in Rome, Italy on 10-14 May 2026. Eurocrypt 2026 is organized by the International Association for Cryptologic Research (IACR). The proceedings will be published by Springer in the LNCS series. 

 Original research papers are welcomed on any cryptographic topic, including but not limited to:

    foundational theory and mathematics
    the design, proposal, and analysis of cryptographic primitives and protocols
    secure implementation and optimization in hardware or software
    applied aspects of cryptography

Please note more generally that a topic for any IACR area conference is a topic for Eurocrypt. Program committee members are no longer allowed to issue reviews such as "This topic is more suitable for [area conference]". 
最后更新 Dou Sun 在 2025-07-13
录取率
时间提交数录取数录取率(%)
20141973819.3%
20132024120.3%
20121954121%
20111673118.6%
20101913317.3%
20091483322.3%
20081633119%
20071733319.1%
20061983316.7%
最佳论文
时间最佳论文
2019Efficient Verifiable Delay Functions
2019Quantum Lightning Never Strikes the Same State Twice
2018Simple Proofs of Sequential Work
2018k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive Circuits
2018Two-Round Multiparty Secure Computation from Minimal Assumptions
2018The Discrete-Logarithm Problem with Preprocessing
2017Scrypt Is Maximally Memory-Hard
2016Tightly CCA-Secure Encryption Without Pairings
2015Cryptanalysis of the Multilinear Map over the Integers
2014Unifying Leakage Models: From Probing Attacks to Noisy Leakage
2014A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
2013Candidate Multilinear Maps from Ideal Lattices
2012Cover and Decomposition Index Calculus on Elliptic Curves Made Practical - Application to a Previously Unreachable Curve over $F_(p^6)$
2011Efficient Authentication from Hard Learning Problems
2010Bonsai Trees, or How to Delegate a Lattice Basis
2009Practical Chosen Ciphertext Secure Encryption from Factoring
2008Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves
2007Zero Knowledge and Soundness Are Symmetric
2006Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
2005Fuzzy Identity-Based Encryption
2005Cryptanalysis of the Hash Functions MD4 and RIPEMD
2005How to Break MD5 and Other Hash Functions
2004Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data