Secrecy types for a simulatable cryptographic library

@inproceedings{Laud2005SecrecyTF,
  title={Secrecy types for a simulatable cryptographic library},
  author={Peeter Laud},
  booktitle={ACM Conference on Computer and Communications Security},
  year={2005}
}
We present a type system for checking secrecy of messages handled by protocols that use the Backes-Pfitzmann-Waidner library for cryptographic operations. A secure realization of this library exists, therefore we obtain for the first time a cryptographically sound analysis for a full language for expressing protocols, particularly handling symmetric encryption and unbounded number of sessions. The language is similar to the spi-calculus, but has a completely deterministic semantics. The type… CONTINUE READING
Highly Cited
This paper has 69 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.
46 Citations
17 References
Similar Papers

Citations

Publications citing this paper.

69 Citations

01020'07'10'13'16
Citations per Year
Semantic Scholar estimates that this publication has 69 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Secrecy Types for a Simulatable Cryptographic Library

  • P. Laud
  • Research Report IT-LU-O-162-050823,
  • 2005
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…