Abstract
Cryptographic schemes must be presented with a security proof based on complexity theory. However, security proofs tend to be complex and difficult to verify, because an adversary can access various kinds of oracles. The use of formal methods is a way to tame such complexity. Hoare logic has been used to verify properties of programs and its probabilistic extension has also been provided. In this paper,we introduce a probabilistic Hoare logic and its application to verification of security proofs of public key encryption schemes. Adversarial attacks are formalized as programs with probabilistic execution and security properties are formalized as first-order logic formulae.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
