Upgrade to Pro
— share decks privately, control downloads, hide ads and more …
Speaker Deck
Sign up for free
Menu
Search
Features
All features
Private URLs
Password Protection
Custom URLS
Scheduled publishing
Remove Branding
Restrict embedding
Deck Collections
Notes
Features
All features
Private URLs
Password Protection
Custom URLS
Scheduled publishing
Remove Branding
Restrict embedding
Deck Collections
Notes
Explore
Featured decks
Featured speakers
Programming
Technology
Storyboards
Explore
Featured decks
Featured speakers
Programming
Technology
Storyboards
Pricing
Search
Sign in
Sign up for free
プロトコルの形式的安全性検証ツールProVerif / proverif
Search
Mako
August 09, 2021
Technology
1.4k
0
Share
Embed
Copy iframe code
Copy JS code
Copy link
Start on current slide
プロトコルの形式的安全性検証ツールProVerif / proverif
seccamp2020 LT大会での発表内容
Mako
August 09, 2021
More Decks by Mako
See All by Mako
マイナンバーカードの暗号技術とセキュリティ
tex2e
2
3.2k
SELinuxで堅牢化する / selinux
tex2e
3
1.9k
TLS 1.3自作入門 / tls13
tex2e
0
1.3k
マイナンバーカードで署名する / mynumbercard
tex2e
2
3.6k
Other Decks in Technology
See All in Technology
その Lambda、8分で 管理者権限まで奪われます
k1nakayama
6
2.8k
顧客に向き合う開発組織へ。リアーキテクチャとフィーチャーチーム化で挑む組織改革
safie
0
2k
2026_devsumi_ozono.pdf
o3
3
510
山手線を徒歩で一周してわかった、 位置情報アプリは「足」が最強のデバッガー
hinakko
0
160
AIで社員の自主発信に広報目線を組み込む
_mossann_t
0
110
技術的負債から考える、AI時代のエンジニアリング投資 — ビズリーチの技術的負債と向き合った経験から、変更し続けられるソフトウェアを考える/ technical-debt-con2026
visional_engineering_and_design
4
3.1k
なぜ「決定性」が 決定的に重要なのか? Durable Execution 基盤の数理的理解 #serverlessjp / ServerlessDays Tokyo 2026
ytaka23
1
360
HHKBエバンジェリストになる方法
941
0
110
[2026-09-11]SREは誰のもの?運用エンジニアが始める 「SRE領域への越境」とチームの進化の軌跡 〜Road to NEXT CRE
tosite
0
290
AI de Idea
kawaguti
PRO
2
120
開発投資の期待値を上げるプロダクトロードマップづくり ~プロダクトエンジニアが越境して事業を伸ばす~
kekekenta
1
190
Reactの設計論
uhyo
24
13k
Featured
See All Featured
GitHub's CSS Performance
jonrohan
1033
470k
16th Malabo Montpellier Forum Presentation
akademiya2063
PRO
0
380
Designing for Timeless Needs
cassininazir
1
480
Understanding Cognitive Biases in Performance Measurement
bluesmoon
32
3k
The Organizational Zoo: Understanding Human Behavior Agility Through Metaphoric Constructive Conversations (based on the works of Arthur Shelley, Ph.D)
kimpetersen
PRO
0
450
The Cult of Friendly URLs
andyhume
79
7k
Build your cross-platform service in a week with App Engine
jlugia
234
19k
Gemini Prompt Engineering: Practical Techniques for Tangible AI Outcomes
mfonobong
2
530
Are puppies a ranking factor?
jonoalderson
2
3.9k
Evolving SEO for Evolving Search Engines
ryanjones
0
290
Six Lessons from altMBA
skipperchong
29
4.5k
HU Berlin: Industrial-Strength Natural Language Processing with spaCy and Prodigy
inesmontani
PRO
0
700
Transcript
ϓϩτίϧͷܗࣜత҆શੑݕূπʔϧ ProVerif @tex2e
ϓϩτίϧͷܗࣜత҆શੑݕূ ϓϩτίϧ α ϓϩτίϧ β ͓ΘΓʹ ProVerif ֓ཁ • Ͱ͖Δ͜ͱɿ ϓϩτίϧΛϞσϧԽͨ͠ίʔυΛهड़ → ProVerif πʔϧͰ࣮ߦ → ੬ऑੑ͋Γɾͳ͠ͷఆ • Θ͔Δ͜ͱɿ ϓϩτίϧͷηΩϡϦςΟಛੑ ൿಗੑɺਅਖ਼ੑɺΦϑϥΠϯ߈ܸɺલํൿಗੑ • ࠓͷ͓ɿ αϯϓϧϓϩτίϧͰݕূ • ϓϩτίϧ α • ϓϩτίϧ β
ϓϩτίϧͷܗࣜత҆શੑݕূ ϓϩτίϧ α ϓϩτίϧ β ͓ΘΓʹ ProVerif • ϓϩτίϧ͕҆શ͔Ͳ͏͔ΛࣗಈͰূ໌ • ୭Ͱ͑ͯແྉ 1 • spi ܭࢉͷॻ͖ํʹ (গ͠) ࣅ͍ͯΔ • ݴޠͱͯ͠ OCaml ʹ (গ͠) ࣅ͍ͯΔ free c: channel. free message: bitstring [private]. query attacker(message). process out(c, message); 0 1 http://proverif.inria.fr/
ϓϩτίϧͷܗࣜత҆શੑݕূ ϓϩτίϧ α ϓϩτίϧ β ͓ΘΓʹ ϓϩτίϧ α Server Client ύεϫʔυ p, ฏจ m ύεϫʔυ p ҉߸Խ enc(m, p) ෮߸ ͜ͷϓϩτίϧ͕҆શ͔Ͳ͏͔Λ ProVerif Ͱݕূ͠·͢
ϓϩτίϧͷܗࣜత҆શੑݕূ ϓϩτίϧ α ϓϩτίϧ β ͓ΘΓʹ ϓϩτίϧͷϞσϧԽ ϋογϡؔ ಛɿ • Ұํؔ : f(m) → h • શͳ҉߸Ϟσϧ2ʹ͓͍ͯٯؔଘࡏ͠ͳ͍ ProVerif ͷίʔυ fun hash(bitstring): bitstring. 2 Dolve-Yao Ϟσϧ
ϓϩτίϧͷܗࣜత҆શੑݕূ ϓϩτίϧ α ϓϩτίϧ β ͓ΘΓʹ ϓϩτίϧͷϞσϧԽ ڞ௨ݤ҉߸ ಛɿ • ҉߸Խ : enc(m, k) • ෮߸ɹ : dec(c, k) • ҉߸Խͱ෮߸ͰݩʹΔ : dec(enc(m, k), k) = m ProVerif ͷίʔυ fun enc(bitstring , key): bitstring. reduc forall m: bitstring , k: key; dec(enc(m,k),k) = m.
ϓϩτίϧͷܗࣜత҆શੑݕূ ϓϩτίϧ α ϓϩτίϧ β ͓ΘΓʹ ϓϩτίϧ αͷϞσϧԽ ΫϥΠΞϯτ–αʔόؒͷ௨৴ (* Ϋ ϥ Π Ξ ϯ τ A *) let clientA() = event beginA(msg); out(c, enc(msg, password)); 0. (* α ʔ ό B *) let serverB() = in(c, x: bitstring); let recvmsg = dec(x, password) in event endB(recvmsg); 0. process ( (!clientA()) | (!serverB()) )
ϓϩτίϧͷܗࣜత҆શੑݕূ ϓϩτίϧ α ϓϩτίϧ β ͓ΘΓʹ ݕূํ๏ ൿಗੑ ݶΒΕͨਓ͔͠ใʹΞΫηεͰ͖ͳ͍͜ͱ • query : ݕূΫΤϦ • attacker(v) : ߈ܸऀม v ʹ౸ୡՄೳ͔ (* ൿ ಗ ੑ ͷ ݕ ূ *) query attacker(msg). query attacker(password).
ϓϩτίϧͷܗࣜత҆શੑݕূ ϓϩτίϧ α ϓϩτίϧ β ͓ΘΓʹ ݕূ݁Ռ ൿಗੑ $ proverif -color protocol1.pv ( {1}! {2}out(c, enc(msg,password)) ) | ( {3}! {4}in(c, x: bitstring); {5}let recvmsg: bitstring = dec(x,password) in 0 ) ... -------------------------------------------------------------- Verification summary: Query not attacker(msg[]) is true. Query not attacker(password[]) is true. ൿಗੑ → ͋Γ ✓ ΦϑϥΠϯ߈ܸ લํൿಗੑ
ϓϩτίϧͷܗࣜత҆શੑݕূ ϓϩτίϧ α ϓϩτίϧ β ͓ΘΓʹ ݕূํ๏ ΦϑϥΠϯ߈ܸ ౪ௌͨ͠༰ΛΦϑϥΠϯͰղಡ͢Δ͜ͱ • weaksecret v. ൿີ v ͷΤϯτϩϐʔ͕͍ͱ͖ 3ɺ ߈ܸऀม v ʹ౸ୡՄೳ͔ (* Φ ϑ ϥ Π ϯ ߈ ܸ ͷ ݕ ূ *) weaksecret password. 3ਓ͕֮ؒ͑ΒΕΔఔͷจࣈྻ͔͠ͳ͍ͱ͖ʢύεϫʔυͳͲʣ
ϓϩτίϧͷܗࣜత҆શੑݕূ ϓϩτίϧ α ϓϩτίϧ β ͓ΘΓʹ ݕূ݁Ռ ΦϑϥΠϯ߈ܸ $ proverif -color protocol1a.pv ... The attacker tests whether dec(~M,@weaksecretcst) is fail knowing ~M = enc(msg,password). This allows the attacker to know whether @weaksecretcst = password. A trace has been found. RESULT Weak secret password is false. ... -------------------------------------------------------------- Verification summary: Weak secret password is false.4 Query not attacker(msg[]) is true. Query not attacker(password[]) is true. ൿಗੑ → ͋Γ ✓ ΦϑϥΠϯ߈ܸ → Մೳ × લํൿಗੑ 4ऑ͍ൿີΛͬͨͱ͖ϓϩτίϧͷ҆શੑͳ͍ɺͱ͍͏ҙຯ
ϓϩτίϧͷܗࣜత҆શੑݕূ ϓϩτίϧ α ϓϩτίϧ β ͓ΘΓʹ ݕূ݁Ռ ΦϑϥΠϯ߈ܸ $ proverif -color protocol1a.pv ... The attacker tests whether dec(~M,@weaksecretcst) is fail knowing ~M = enc(msg,password). This allows the attacker to know whether @weaksecretcst = password. A trace has been found. RESULT Weak secret password is false. ... -------------------------------------------------------------- Verification summary: Weak secret password is false.4 Query not attacker(msg[]) is true. Query not attacker(password[]) is true. ൿಗੑ → ͋Γ ✓ ΦϑϥΠϯ߈ܸ → Մೳ × લํൿಗੑ 4ऑ͍ൿີΛͬͨͱ͖ϓϩτίϧͷ҆શੑͳ͍ɺͱ͍͏ҙຯ
ϓϩτίϧͷܗࣜత҆શੑݕূ ϓϩτίϧ α ϓϩτίϧ β ͓ΘΓʹ ݕূ݁Ռ ΦϑϥΠϯ߈ܸ A trace has been found. Honest Process Attacker ! ! Beginning of process clientA ~M = enc(msg,password) The attacker tests whether dec(~M,@weaksecretcst) is fail knowing ~M = enc(msg,password). This allows the attacker to know whether @weaksecretcst = password.
ϓϩτίϧͷܗࣜత҆શੑݕূ ϓϩτίϧ α ϓϩτίϧ β ͓ΘΓʹ ݕূํ๏ લํൿಗੑ ൿີݤ͕࿙Ӯͯ͠ɺաڈͷ҉߸Խ௨৴͕෮߸Ͱ͖ͳ͍͜ͱ • phase 1; out(c, password) Phase 0 : ύεϫʔυͰฏจ m Λ҉߸Խͯ͠ૹ৴ Phase 1 : ύεϫʔυΛ࿙Ӯͤ͞Δ ύεϫʔυ࿙Ӯޙʹ߈ܸऀฏจ m ʹ౸ୡՄೳ͔ (* લ ํ ൿ ಗ ੑ ͷ ݕ ূ *) process ( (!clientA()) | (!serverB()) | phase 1; out(c, password) )
ϓϩτίϧͷܗࣜత҆શੑݕূ ϓϩτίϧ α ϓϩτίϧ β ͓ΘΓʹ ݕূ݁Ռ લํൿಗੑ $ proverif -color protocol1b.pv ... ( {1}! {2}out(c, enc(msg,password)) ) | ( {3}! {4}in(c, x: bitstring); {5}let recvmsg: bitstring = dec(x,password) in 0 ) | ( {6}phase 1; {7}out(c, password) ) ... -------------------------------------------------------------- Verification summary: Query not attacker_p1(msg[]) is false. Query not attacker_p1(password[]) is false. ൿಗੑ → ͋Γ ✓ ΦϑϥΠϯ߈ܸ → Մೳ × લํൿಗੑ → ͳ͠ ×
ϓϩτίϧͷܗࣜత҆શੑݕূ ϓϩτίϧ α ϓϩτίϧ β ͓ΘΓʹ ݕূ݁Ռ લํൿಗੑ A trace has been found. Honest Process Attacker ! ! Beginning of process clientA ~M = enc(msg,password) Phase 1 ~M_1 = password The attacker has the message dec(~M,~M_1) = msg in phase 1
ϓϩτίϧͷܗࣜత҆શੑݕূ ϓϩτίϧ α ϓϩτίϧ β ͓ΘΓʹ ରࡦɾվળ ΦϑϥΠϯ߈ܸͱલํൿಗੑ • ΦϑϥΠϯ߈ܸɿ ऑ͍ݤ͔Βڧ͍ݤΛ࡞Δ • લํൿಗੑɿ ௨৴ຖʹҟͳΔڞ௨ݤΛ͏Α͏ʹ͢Δ
ϓϩτίϧͷܗࣜత҆શੑݕূ ϓϩτίϧ α ϓϩτίϧ β ͓ΘΓʹ Diffie-Hellman ݤڞ༗ (DH) 1. Alice ཚ a Λબ͢Δ 2. Alice→Bob : A = ga (mod p) 3. Bob ཚ b Λબ͢Δ 4. Bob→Alice : B = gb (mod p) 5. Alice ͱ Bob ڞ௨ݤ K ͕ٻ·Δɿ K = (ga)b = gab = (gb)a (mod p) ੜݩ g ͱૉ p ΛదʹબͿͱ͖ɺ౪ௌऀެ։ A, B ͔Βڞ ༗ݤ K ΛٻΊΔ͜ͱࠔʢࢄରʣ
ϓϩτίϧͷܗࣜత҆શੑݕূ ϓϩτίϧ α ϓϩτίϧ β ͓ΘΓʹ ϓϩτίϧͷϞσϧԽ Diffie-Hellman ݤڞ༗ (DH ݤڞ༗) • Ұํ : A = ga (mod p) A = exp(g, a) • ެ։͔Βڞ௨ݤ͕ٻ·Δ : K = (ga)b = gab = (gb)a (mod p) K = exp(exp(g, a), b) = exp(exp(g, b), a) ProVerif ͷίʔυ type G. type exponent. const g: G [data]. (* ੜ ݩ g *) fun exp(G, exponent): G. equation forall a: exponent , b: exponent; exp(exp(g,a),b) = exp(exp(g,b),a).
ϓϩτίϧͷܗࣜత҆શੑݕূ ϓϩτίϧ α ϓϩτίϧ β ͓ΘΓʹ ϓϩτίϧ β DH ݤڞ༗ + ҉߸Խ Server Client ύεϫʔυ p, ฏจ m ύεϫʔυ p ੜݩ g = genG(p) ੜݩ g = genG(p) ga gb gab gab ڞ༗ݤ s = KDF(gba) ڞ༗ݤ s = KDF(gab) ҉߸Խ enc(m, s) ෮߸
ϓϩτίϧͷܗࣜత҆શੑݕূ ϓϩτίϧ α ϓϩτίϧ β ͓ΘΓʹ ϓϩτίϧ β DH ݤڞ༗ + ҉߸Խ Server Client ύεϫʔυ p, ฏจ m ύεϫʔυ p ੜݩ g = genG(p) ੜݩ g = genG(p) ga gb gab gab ڞ༗ݤ s = KDF(gba) ڞ༗ݤ s = KDF(gab) ҉߸Խ enc(m, s) ෮߸
ϓϩτίϧͷܗࣜత҆શੑݕূ ϓϩτίϧ α ϓϩτίϧ β ͓ΘΓʹ ϓϩτίϧ β ͷϞσϧԽ ΫϥΠΞϯτ–αʔόؒͷ௨৴ let clientA() = new randomA: exponent; let gA = exp(genG(password), randomA) in out(c, gA); in(c, gB: G); let sharedSecret = KDF(exp(gB, randomA)) in let ciphertext = enc(msg, sharedSecret) in out(c, ciphertext); 0. let serverB() = new randomB: exponent; let gB = exp(genG(password), randomB) in in(c, gA: G); out(c, gB); let sharedSecret = KDF(exp(gA, randomB)) in in(c, ciphertext: bitstring); let recvmsg = dec(ciphertext , sharedSecret) in 0. process ( (!clientA()) | (!serverB()) )
ϓϩτίϧͷܗࣜత҆શੑݕূ ϓϩτίϧ α ϓϩτίϧ β ͓ΘΓʹ ݕূํ๏ ൿಗੑɺΦϑϥΠϯ߈ܸɺલํൿಗੑ • attacker(v) ߈ܸऀม v ʹ౸ୡՄೳ͔ • weaksecret v. ൿີͷ v ͷΤϯτϩϐʔ͕͍ͱ͖ɺ ߈ܸऀม v ʹ౸ୡՄೳ͔ • phase 1; out(c, password) Phase 0 : ύεϫʔυͰฏจ m Λ҉߸Խͯ͠ૹ৴ Phase 1 : ύεϫʔυΛ࿙Ӯͤ͞Δ ύεϫʔυ࿙Ӯޙʹ߈ܸऀฏจ m ʹ౸ୡՄೳ͔
ϓϩτίϧͷܗࣜత҆શੑݕূ ϓϩτίϧ α ϓϩτίϧ β ͓ΘΓʹ ݕূ݁Ռ ൿಗੑɺΦϑϥΠϯ߈ܸ $ proverif -color protocol2a.pv ... -------------------------------------------------------------- Verification summary: Query not attacker(msg[]) is true. Query not attacker(password[]) is true. Weak secret password is true. ൿಗੑ → ͋Γ ✓ ΦϑϥΠϯ߈ܸ → ࠔ ✓ લํൿಗੑ
ϓϩτίϧͷܗࣜత҆શੑݕূ ϓϩτίϧ α ϓϩτίϧ β ͓ΘΓʹ ݕূ݁Ռ લํൿಗੑ $ proverif -color protocol2b.pv ... -------------------------------------------------------------- Verification summary: Query not attacker_p1(msg[]) is true. Query not attacker_p1(password[]) is false. ... ൿಗੑ → ͋Γ ✓ ΦϑϥΠϯ߈ܸ → ࠔ ✓ લํൿಗੑ → ͋Γ ✓
ϓϩτίϧͷܗࣜత҆શੑݕূ ϓϩτίϧ α ϓϩτίϧ β ͓ΘΓʹ ϓϩτίϧ β Wi-Fi ͷ৽ن֨ WPA3 Λࢀߟʹ࡞ Server Client ύεϫʔυ p, ฏจ m ύεϫʔυ p ੜݩ g = genG(p) ੜݩ g = genG(p) ga gb gab gab ڞ༗ݤ s = KDF(gba) ڞ༗ݤ s = KDF(gab) ҉߸Խ enc(m, s) ෮߸
ϓϩτίϧͷܗࣜత҆શੑݕূ ϓϩτίϧ α ϓϩτίϧ β ͓ΘΓʹ ͓ΘΓʹ • ProVerif ൿಗੑਅਖ਼ੑΛࣗಈͰݕূՄೳ • ͍ΖΜͳϓϩτίϧΛݕূͯ͠ΈΔͱָ͍͠ Happy ProVerifying!
ϓϩτίϧͷܗࣜత҆શੑݕূ ϓϩτίϧ α ϓϩτίϧ β ͓ΘΓʹ ࢀߟจݙ I Blanchet at el.: ProVerif 2.02pl1: Automatic Cryptographic Protocol Verifier, User Manual and Tutorial. INRIA, September 2020. Blanchet: ProVerif Automatic Cryptographic Protocol Verifier User Manual for Untyped Inputs. INRIA, September 2020.