Public Key Cryptography
summary
Presents a new identity‑based revocation construction that achieves fully attribute-hiding and function private IPE by first building a predicate‑only zero‑IP scheme in the standard model (proved under a K-M-DDH assumption and generic‑group reductions), then compiling it to full inner‑product encryption; result yields the first practical IBR system but with a linear loss in ciphertext length. Also gives a full computational analysis of EDHOC (four auth methods), deriving concrete bounds that favor the AS-256 cipher suite.
AI-written summary · about
chapters (20)
- 0:00Public key cryptography intro
- 1:03Predicate encryption basics
- 3:31Security in predicate encryption
- 5:21Gaps in predicate encryption
- 8:40Challenges in inner product encryption
- 10:46Constructing predicate-only inner product encryption
- 12:11Mathematical framework for IPE
- 15:06Security vs efficiency trade-offs
- 17:13Transforming predicate-only to full inner product encryption
- 19:22Revocation in identity-based systems
- 20:04Summary of results
- 21:51Open research questions
- 22:13EDHOC protocol for IoT
- 24:44EDHOC overview and auth methods
- 26:28Signature-static EDHOC flow
- 29:20EDHOC key derivation
- 30:50EDHOC security analysis
- 32:19Security properties in EDHOC
- 34:08EDHOC security estimates
- 35:13Choosing cipher suites
