Deciding knowledge in security protocols under some e-voting theories

DOI10.1051/ITA/2011119MaRDI QIDQ3095038zbMATH OpenOpenAlexFDO

Authors Mouhebeddine Berrima, Narjes Ben Rajeb, Véronique Cortier

Publication date 28 October 2011

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/222090

zbMATH Keywords

decidabilitydeductione-votingequational theoryformal methodssecurity protocolsstatic equivalence

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Network protocols (68M12) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Deciding knowledge in security protocols under equational theories
• Automata, Languages and Programming
• Decidability and combination results for two notions of knowledge in security protocols
• Verifying privacy-type properties of electronic voting protocols: a taster
• Combining Algorithms for Deciding Knowledge in Security Protocols
• To know or not to know: Epistemic approaches to security protocol verification
• Applied Cryptography and Network Security
• Computing knowledge in security protocols under convergent equational theories
• Computing Knowledge in Security Protocols under Convergent Equational Theories

Cites work

• An NP decision procedure for protocol insecurity with XOR
• Automatic recognition of tractability in inference relations
• Combining Algorithms for Deciding Knowledge in Security Protocols
• Computer Aided Verification
• Computing Knowledge in Security Protocols under Convergent Equational Theories
• Deciding Knowledge in Security Protocols for Monoidal Equational Theories
• Deciding knowledge in security protocols under equational theories
• Easy intruder deduction problems with homomorphisms
• scientific article; zbMATH DE number 3825707 (Why is no real title available?)
• scientific article; zbMATH DE number 3299786 (Why is no real title available?)
• Information Security and Cryptology - ICISC 2003
• Mobile values, new names, and secure communication
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• Rewriting
• Term Rewriting and Applications
• Verifying privacy-type properties of electronic voting protocols: a taster
• YAPA: A Generic Tool for Computing Intruder Knowledge

Cited in

(5)

• Combining Algorithms for Deciding Knowledge in Security Protocols
• Computing knowledge in security protocols under convergent equational theories
• Decidability and combination results for two notions of knowledge in security protocols
• Automata, Languages and Programming
• Model checking indistinguishability of randomized security protocols

Describes a project that uses

Uses Software

• AVISPA
• YAPA

This page was built for publication: Deciding knowledge in security protocols under some e-voting theories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3095038)