🏠홈📊트렌드🏆논문👤마이
🎓
CS-Pedia
TrendsBest Papers
CS Conference Hub

Deadlines, Rankings
& Best Papers — all in one.

Acceptance rates · Best papers · Conference deadlines for CS researchers

← 학회 목록으로

CRYPTO

Security마감

International Cryptology Conference

📍 Santa Barbara, USA · 2026-08-17 ~ 2026-08-20

공식 웹사이트DBLP정보 오류 신고
키워드EncryptionLatticeHomomorphicEfficientZero-Knowledge

기관 인정 현황?

BK21
4점
KIISE
최우수
KAIST
최우수
SNU
✓
POST
최우수

데드라인

2026 (main)
📍 Santa Barbara, USA
📝 Paper: 2026-02-12
📬 Notification: 2026-05-04
📅 학회: 2026-08-17 ~ 2026-08-20

데드라인은 변경될 수 있습니다. 제출 전 공식 웹사이트에서 최종 일정을 확인하세요.

Acceptance Rate?

연도제출채택채택률
2021—1—
2020—11—

Research Trend?

Best Papers

🏆 2025Best Paper Award
On One-Shot Signatures, Quantum vs Classical Binding, and Obfuscating Permutations
Shmueli & Zhandry
Quantum SignaturesObfuscation
🏆 2024Best Paper Award (Early Career)
Lossy Cryptography from Code-Based Assumptions
Dao & Jain
Code-Based CryptographyPost-Quantum
🏆 2024Best Paper Award
STIR: Reed-Solomon Proximity Testing with Fewer Queries
Arnon, Chiesa, Fenzi & Yogev
Zero-Knowledge ProofsReed-Solomon
🏆 2024Best Paper Award
Space-Efficient and Noise-Robust Quantum Factoring
Ragavan & Vaikuntanathan
Quantum CryptographyFactoring
🏆 2023Best Paper Award
Fast Practical Lattice Reduction through Iterated Compression
Ryan & Heninger
Lattice CryptographyLLL Algorithm
🏆 2023Best Paper Award (Early Career)
Fully Adaptive Schnorr Threshold Signatures
Crites, Komlo & Maller
Threshold SignaturesSchnorr
🏆 2022Best Paper Award
Batch Arguments for NP and More from Standard Assumptions
Waters & Wu
Succinct ArgumentsStandard Assumptions
🏆 2022Best Paper Award (Early Career)
Breaking Rainbow Takes a Weekend on a Laptop
Beullens
Post-Quantum CryptographyCryptanalysis
🏆 2022Best Paper Award (Early Career)
Some Easy Instances of Ideal-SVP and Implications on the Partial Vandermonde Knapsack Problem
Boudgoust, Gachon & Pellet-Mary
Lattice CryptographySVP
🏆 2021Best Paper Award
Efficient Key Recovery for All HFE Signature Variants
Tao, Petzoldt & Ding
Post-Quantum CryptographySignature Schemes
🏆 2021Best Paper Award
On the Possibility of Basing Cryptography on EXP ≠ BPP
Liu & Pass
FoundationsComplexity Theory

CS-Pedia — 한국 CS 연구자를 위한 학회 통합 플랫폼

데이터 출처: DBLP (CC0), OpenAlex (CC0), Semantic Scholar, aideadlin.es (MIT), 한국연구재단, 한국정보과학회, jeffhuang.com

제출 전 데드라인·학회 일정은 공식 웹사이트에서 반드시 확인하세요.

소개·개인정보 처리방침·이용약관·문의