Deciding knowledge in security protocols under some e-voting theories

DOI10.1051/ita/2011119zbMath1223.68016OpenAlexW2116900607MaRDI QIDQ3095038

Véronique Cortier, Narjes Ben Rajeb, Mouhebeddine Berrima

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

decidabilityformal methodsdeductionequational theorysecurity protocolsstatic equivalencee-voting

Mathematics Subject Classification ID

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

Related Items

Computing knowledge in security protocols under convergent equational theories

Uses Software

• YAPA
• AVISPA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An NP decision procedure for protocol insecurity with XOR
• Deciding knowledge in security protocols under equational theories
• Easy intruder deduction problems with homomorphisms
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• Deciding Knowledge in Security Protocols for Monoidal Equational Theories
• Combining Algorithms for Deciding Knowledge in Security Protocols
• Verifying Privacy-Type Properties of Electronic Voting Protocols: A Taster
• YAPA: A Generic Tool for Computing Intruder Knowledge
• Mobile values, new names, and secure communication
• Computing Knowledge in Security Protocols under Convergent Equational Theories
• Automatic recognition of tractability in inference relations
• Term Rewriting and Applications
• Information Security and Cryptology - ICISC 2003
• Computer Aided Verification