Prikladnaya Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Prikladnaya Diskretnaya Matematika, 2009, Number 1(3), Pages 79–92 (Mi pdm53)  

Mathematical Foundations of Cryptography

Modelling of the PKI protocols in the universally composable framework using model checkers

S. E. Prokopyev

Moscow
References:
Abstract: We analyze the PKI protocols in the universally composable security framework with following purposes: 1) decomposition of the code of the cryptographic service “Digital Signature with PKI” to the high- and low-danger parts, 2) obtaining a deterministic and cryptographically sound abstraction of this service. We experimented with NuSMV model checker to automate partially our analysis.
Document Type: Article
UDC: 681.322
Language: Russian
Citation: S. E. Prokopyev, “Modelling of the PKI protocols in the universally composable framework using model checkers”, Prikl. Diskr. Mat., 2009, no. 1(3), 79–92
Citation in format AMSBIB
\Bibitem{Pro09}
\by S.~E.~Prokopyev
\paper Modelling of the PKI protocols in the universally composable framework using model checkers
\jour Prikl. Diskr. Mat.
\yr 2009
\issue 1(3)
\pages 79--92
\mathnet{http://mi.mathnet.ru/pdm53}
Linking options:
  • https://www.mathnet.ru/eng/pdm53
  • https://www.mathnet.ru/eng/pdm/y2009/i1/p79
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Прикладная дискретная математика
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024