2010
DOI: 10.1007/978-3-642-11512-7_19 View full text |Buy / Rent full text
|
|

Abstract: Chosen-ciphertext security is by now a standard security property for asymmetric encryption. Many generic constructions for building secure cryptosystems from primitives with lower level of security have been proposed. Providing security proofs has also become standard practice. There is, however, a lack of automated verification procedures that analyze such cryptosystems and provide security proofs. This paper presents an automated procedure for analyzing generic asymmetric encryption schemes in the random or… Show more

Help me understand this report

Search citation statements

Order By: Relevance
Select...
1
1
0
2
0

Year Published

2012
2012
2012
2012

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

0
2
0
Order By: Relevance
“…Other computationally sound logics include CIL (Computational Indistinguishability Logic) [30] and a specialized Hoare logic designed for proving asymmetric encryption schemes in the random oracle model [95,96].…”
Section: Adapting Techniques From the Symbolic Modelmentioning
Create an account to read the remaining citation statements from this report. You will also get access to:
  • Search over 1.2b+ citation statments to see what is being said about any topic in the research literature
  • Advanced Search to find publications that support or contrast your research
  • Citation reports and visualizations to easily see what publications are saying about each other
  • Browser extension to see Smart Citations wherever you read research
  • Dashboards to evaluate and keep track of groups of publications
  • Alerts to stay on top of citations as they happen
  • Automated reference checks to make sure you are citing reliable research in your manuscripts
  • 7 day free preview of our premium features.

Trusted by researchers and organizations around the world

Over 130,000 students researchers, and industry experts at use scite

See what students are saying

rupbmjkragerfmgwileyiopcupepmcmbcthiemesagefrontiersapsiucrarxivemeralduhksmucshluniversity-of-gavle
“…Other computationally sound logics include CIL (Computational Indistinguishability Logic) [30] and a specialized Hoare logic designed for proving asymmetric encryption schemes in the random oracle model [95,96].…”
Section: Adapting Techniques From the Symbolic Modelmentioning
“…Courant [6] presented a method to automatically prove the IND-CCA2 security of encryption schemes in random oracle model and proved the security of BR93 encryption scheme. The proof is described by Hoare logic and proceeds in two steps.…”
Section: Introductionmentioning