Write, autoreview, editor, reviewer
3,129
edits
Line 80: | Line 80: | ||
## '''If''' <math>T_i=1</math> and <math>A_i\oplus B_i=X_i\cdot Y_i</math> '''then''' <math>C_i=\bot</math> | ## '''If''' <math>T_i=1</math> and <math>A_i\oplus B_i=X_i\cdot Y_i</math> '''then''' <math>C_i=\bot</math> | ||
#He aborts '''If''' <math>\sum_j C_j<m\times \Bigg(\omega_{exp}-\delta_{est}}(1-(1-\gamma)^{s_{\max}\Bigg)) | #He aborts '''If''' <math>\sum_j C_j<m\times \Bigg(\omega_{exp}-\delta_{est}}(1-(1-\gamma)^{s_{\max}\Bigg)) | ||
* ''i.e.'', if they do not achieve the expected violation. | * ''i.e.'', if they do not achieve the expected violation. | ||
<u>'''Stage 4'''</u> Privacy amplification | <u>'''Stage 4'''</u> Privacy amplification</br> | ||
*<math>PA(\cdot,\cdot)</math> is a privacy amplification subroutine | *<math>PA(\cdot,\cdot)</math> is a privacy amplification subroutine | ||
# Sender and Receiver run <math>PA(A_1^{n'},\tilde{B}_1^{n'})</math> and obtain secret keys <math>K_A, K_B</math>; | # Sender and Receiver run <math>PA(A_1^{n'},\tilde{B}_1^{n'})</math> and obtain secret keys <math>K_A, K_B</math>; | ||
==Further Information== | ==Further Information== |