Deducibility constraints and blind signatures

DOI10.1016/j.ic.2014.07.006zbMath1360.94298OpenAlexW2064744018MaRDI QIDQ462488

Sergiu Bursuc, Stéphanie Delaune, Hubert Comon-Lundh

Publication date: 20 October 2014

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2014.07.006

zbMATH Keywords

verificationformal methodssecurity protocolconstraint system

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items

Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity ⋮ When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus

Cites Work

• Equational problems and disunification
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures
• Symbolic protocol analysis for monoidal equational theories
• Deciding security properties for cryptographic protocols. application to key cycles
• Automated complexity analysis based on ordered resolution
• Deducibility Constraints
• A practical secret voting scheme for large scale elections
• Blind Signature System
• Mobile values, new names, and secure communication
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Automatic recognition of tractability in inference relations
• Programming Languages and Systems
• Programming Languages and Systems
• A Proof Theoretic Analysis of Intruder Theories