Sciweavers

10 search results - page 2 / 2
» Cryptographically Sound Security Proofs for Basic and Public...
Sort
View
JOC
2007
129views more  JOC 2007»
13 years 4 months ago
Formal Proofs for the Security of Signcryption
Signcryption is a public key or asymmetric cryptographic method that provides simultaneously both message confidentiality and unforgeability at a lower computational and communica...
Joonsang Baek, Ron Steinfeld, Yuliang Zheng
ASIAN
2006
Springer
116views Algorithms» more  ASIAN 2006»
13 years 8 months ago
Secrecy Analysis in Protocol Composition Logic
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
ASIAN
2007
Springer
126views Algorithms» more  ASIAN 2007»
13 years 11 months ago
Computational Semantics for Basic Protocol Logic - A Stochastic Approach
Abstract. This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first ord...
Gergei Bana, Koji Hasebe, Mitsuhiro Okada
FM
2006
Springer
153views Formal Methods» more  FM 2006»
13 years 8 months ago
Formal Methods and Cryptography
Security-critical systems are an important application area for formal methods. However, such systems often contain cryptographic subsystems. The natural definitions of these subsy...
Michael Backes, Birgit Pfitzmann, Michael Waidner
EUROPKI
2009
Springer
13 years 2 months ago
Automatic Generation of Sigma-Protocols
Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many cryptographic applications such as identification schemes, group signatures, and secure mult...
Endre Bangerter, Thomas Briner, Wilko Henecka, Ste...