Two views of cryptography and the gap in-between
| dc.contributor.author | Wu, Zehou | |
| dc.contributor.supervisor | Kapron, Bruce | |
| dc.contributor.supervisor | Lu, Yun | |
| dc.date.accessioned | 2025-04-30T20:23:36Z | |
| dc.date.available | 2025-04-30T20:23:36Z | |
| dc.date.issued | 2025 | |
| dc.degree.department | Department of Computer Science | |
| dc.degree.level | Master of Science MSc | |
| dc.description.abstract | There are two popular views of cryptography. One is formal (symbolic), which uses expressions to model the ideal functionality of encryption functions and is easy to verify. The other is computational, which is what cryptographic assumptions rely on and is used for most security definitions. The challenge of reconciling these two views of cryptography lies in security under the presence of encryption cycles. In this thesis, we provide a proof of completeness for Abadi-Rogaway symbolic logic with respect to KDM security, a strong form of circular security. Further, we provide a larger set of expressions for which Micciancio's symbolic logic is complete with respect to CPA security, extending Micciancio's completeness, which holds only for the set of acyclic expressions. We also give an alternate characterization of Micciancio's logic. On the computational side, we give a proof that circular insecurity is maintained as cycle length decreases, which is not a previously shown result. | |
| dc.description.scholarlevel | Graduate | |
| dc.identifier.uri | https://hdl.handle.net/1828/22060 | |
| dc.language | English | eng |
| dc.language.iso | en | |
| dc.rights | Available to the World Wide Web | |
| dc.subject | Symbolic encryption | |
| dc.subject | Circular security | |
| dc.subject | CPA | |
| dc.subject | KDM | |
| dc.subject | Symmetric key | |
| dc.subject | Public key | |
| dc.title | Two views of cryptography and the gap in-between | |
| dc.type | Thesis |