Peeter Laud
Peeter Laud
Cybernetica AS
Verified email at - Homepage
Cited by
Cited by
Time-stamping with binary linking schemes
A Buldas, P Laud, H Lipmaa, J Villemson
Advances in Cryptology—CRYPTO'98, 486-501, 1998
Semantics and program analysis of computationally secure information flow
P Laud
European Symposium on Programming, 77-91, 2001
Symmetric encryption in automatic analyses for confidentiality against active adversaries
P Laud
IEEE Symposium on Security and Privacy, 2004. Proceedings. 2004, 71-85, 2004
Accountable certificate management using undeniable attestations
A Buldas, P Laud, H Lipmaa
Proceedings of the 7th ACM Conference on Computer and Communications …, 2000
Rational choice of security measures via multi-parameter attack trees
A Buldas, P Laud, J Priisalu, M Saarepera, J Willemson
International Workshop on Critical Information Infrastructures Security, 235-248, 2006
Secrecy types for a simulatable cryptographic library
P Laud
Proceedings of the 12th ACM conference on Computer and communications …, 2005
Computationally sound secrecy proofs by mechanized flow analysis
M Backes, P Laud
Proceedings of the 13th ACM conference on Computer and communications …, 2006
Handling encryption in an analysis for secure information flow
P Laud
European Symposium on Programming, 159-173, 2003
The application of i-voting for Estonian parliamentary elections of 2011
S Heiberg, P Laud, J Willemson
International Conference on E-Voting and Identity, 208-223, 2011
A type system for computationally secure information flow
P Laud, V Vene
International Symposium on Fundamentals of Computation Theory, 365-377, 2005
Eliminating counterevidence with applications to accountable certificate management 1
A Buldas, P Laud, H Lipmaa
Journal of Computer Security 10 (3), 273-296, 2002
New linking schemes for digital time-stamping.
A Buldas, P Laud
ICISC 98, 3-14, 1998
Combining differential privacy and secure multiparty computation
M Pettai, P Laud
Proceedings of the 31st Annual Computer Security Applications Conference …, 2015
Domain-polymorphic programming of privacy-preserving applications
D Bogdanov, P Laud, J Randmets
Proceedings of the Ninth Workshop on Programming Languages and Analysis for …, 2014
On the computational soundness of cryptographically masked flows
P Laud
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of …, 2008
Sound computational interpretation of formal encryption with composed keys
P Laud, R Corin
International Conference on Information Security and Cryptology, 55-66, 2003
Encryption cycles and two views of cryptography
P Laud
Proceedings of the 7th Nordic Workshop on Secure IT Systems (NORDSEC) 31, 85-100, 2002
From input private to universally composable secure multi-party computation primitives
D Bogdanov, P Laud, S Laur, P Pullonen
2014 IEEE 27th Computer Security Foundations Symposium, 184-198, 2014
Analysis for object inlining in Java
P Laud
In Proceedings of the Joses Workshop, 2001
Type systems equivalent to data-flow analyses for imperative languages
P Laud, T Uustalu, V Vene
Theoretical Computer Science 364 (3), 292-310, 2006
The system can't perform the operation now. Try again later.
Articles 1–20