SK-R&D · Ltd liab. Co

Logic Security Psychology

Services & Products

Simon KRAMER

Logic Researcher & Software Developer

Contact

Boulevard de Grancy 20
1006 Lausanne
Switzerland

simon.kramer@a3.epfl.ch

arXiv, LinkedIn
Simon KRAMER



Please enable JavaScript in the preferences of this Web-browser to view here the tag cloud for this Web-page.

Previous positions

2011-2013: Research Associate at the University of Luxembourg
2011-2013: Guest Researcher at the IMSc, Chennai, India
2008-2010: JSPS Post-doctoral Fellow at the University of Tsukuba
2007-2008: INRIA Post-doctoral Researcher at Ecole Polytechnique

Professional affiliations

ACM, ASL, CiE, FoLLI, IACR, IEEE, ISSS, SSLPS

Commercial Activity

In computer security, any bug is a potential security bug.

Consultancy Services & Software Products

Academic Activity

Our concern must be applied, and our approach formal and based on the conviction that
logic is the interdisciplinary and unifying scientific discipline par excellence.

Journal Papers

IfCoLog JLA: Computer-Aided Discovery and Categorisation of Personality Axioms, 2014. [to appear in Volume 1, Number 2]
JLC: Computer-Aided Decision-Making with Trust Relations and Trust Domains (Cryptographic Applications), 2012. [BibTeX]
JCV: A General Definition of Malware, 2010. [BibTeX]
JANCL: A Quantitative Doxastic Logic for Probabilistic Processes and Applications to Information-Hiding, 2009. [BibTeX]
JLAP: Cryptographic Protocol Logic: Satisfaction for (Timed) Dolev-Yao Cryptography, 2008. [BibTeX]

Conference and Workshop Papers

ISA Congress 2014: A Galois-Connection between Myers-Briggs' Type Indicators and Szondi's Personality Profiles
ISA Congress 2014: The Fate-Analytic Partner Profile - A Proposal
IMLA 2013 - ENTCS: Logic of Negation-Complete Interactive Proofs [BibTeX]
ICLA 2013 - LNCS: Logic of Non-Monotonic Interactive Proofs [BibTeX]
REVOTE 2011 (RE-affiliated): - IEEE: A Modular Multi-Modal Specification of Real-Timed, End-To-End Voter-Verifiable Voting Systems [BibTeX]
LiS 2010 (ESSLLI-affiliated): Formal Definitions and Complexity Results for Trust Relations and Trust Domains [BibTeX]
LiS 2010 (ESSLLI-affiliated): A Multi-Modal Framework for Achieving Accountability in Multi-Agent Systems [BibTeX]
IMLA 2008 (LiCS-affiliated): Reducing Provability to Knowledge in Multi-Agent Systems [BibTeX]
FCS-ARSPA 2007 (LiCS/ICALP-affiliated), LORI 2007 (LMPS-affiliated):
The Meaning of a Cryptographic Message via Hypothetical Knowledge and Provability [BibTeX]
FAST 2006 (FM-affiliated, acceptance rate: 16/44) - LNCS: Timed Calculus of Cryptographic Communication [BibTeX]
FCS-ARSPA 2006 (LiCS-affiliated, acceptance rate: 16/27): Calculus of Cryptographic Communication [BibTeX]
FCS 2004 (LiCS/ICALP-affiliated, acceptance rate: 13/45): Cryptographic Protocol Logic [BibTeX]
EC-Web 2000 - LNCS: MIERA: Method for Inter-Enterprise Role-Based Authorization [BibTeX]

Theses

Dr.Sc.: Logical Concepts in Cryptography, 2007. [BibTeX]
Referees
Prof. S. N. Artëmov, City University of New York and Moscow State University
Prof. R. Küsters, Eidgenössische Technische Hochschule Zürich
Prof. L. S. Moss, Indiana University
Announcements
ACM SIGACT News, Volume 38, Issue 4 (Logic Column 20), December 2007
Andy Gordon's blog, 21 June 2007
EATCS Bulletin Number 93, October 2007
Riccardo Pucella's blog, 28 November 2007
SECURITY mailing list (443 recipients), 14 July 2007
M.Sc.: A Formal Specification for a Real-Time Train Controller, 2001. [BibTeX]

Technical Reports

ACM SIGACT News (Logic Column)
Formal Definitions and Complexity Results for Trust Relations and Trust Domains fit for
TTPs, the Web of Trust, PKIs, and ID-Based Cryptography
, 2010 (March issue).
[BibTeX]
arXiv
Quantum Logic as Classical Logic, 2014. [BibTeX]
A Galois-Connection between Cattell's and Szondi's Personality Profiles, 2014. [BibTeX]
Computer-Aided Discovery and Categorisation of Personality Axioms, 2014. [BibTeX]
A Galois-Connection between Myers-Briggs' Type Indicators and Szondi's Personality Profiles, 2014. [BibTeX]
Logic of Intuitionistic Interactive Proofs (Formal Theory of Perfect Knowledge Transfer), 2013. [BibTeX]
Parametric Constructive Kripke-Semantics for Standard Multi-Agent Belief and Knowledge (Knowledge As Unbiased Belief), 2012. [BibTeX]
Logic of Negation-Complete Interactive Proofs (Formal Theory of Epistemic Deciders), 2012. [BibTeX]
Logic of Non-Monotonic Interactive Proofs (Formal Theory of Temporary Knowledge Transfer), 2012. [BibTeX]
A Logic of Interactive Proofs (Formal Theory of Knowledge Transfer), 2012. [BibTeX]
Cryptology ePrint Archive
Computer-Aided Decision-Making with Trust Relations and Trust Domains (Cryptographic Applications), 2011. [BibTeX]
Logical Concepts in Cryptography, 2006. [BibTeX]
IBM Research Laboratory, Zurich
MIERA: A Method for Inter-Enterprise Role-Based Authorization, 2000. [BibTeX]
An Enhancement and Implementation for the MIERA Scheme, 2000. [BibTeX]

Notes

CLPS 2013: Logic of Intuitionistic Interactive Proofs (Formal Theory of Disjunctive Knowledge Transfer).
CiE 2010, AiML 2010: An Intuitionistic Foundation for Interactive Computation.
TCV 2008: A General Definition of Malware.
NWPT 2006: Timed Cryptographic Protocol Logic.
MCP 2006: Logical Abstractions for Protocol Engineering.
LiCS 2003: A Language and a Notion of Truth for Cryptographic Properties.

Invited Talks

Classical Modal Logics of Interactive Proofs
25.04.2013: University of Bern
Logic of Negation-Complete Interactive Proofs (Formal Theory of Epistemic Deciders)
01.03.2013: Calcutta Logic Circle at The School of Cognitive Science, Jadavpur University, Kolkata
A Modular Multi-Modal Specification of Real-Timed, End-To-End Voter-Verifiable Voting Systems
29.03.2012: Bern University of Applied Sciences
A Logic of Interactive Proofs (Formal Theory of Knowledge Transfer)
04.06.2012: University of Amsterdam
25.05.2012: LMU-TU Munich Graduiertenkolleg PUMA
10.05.2012: University of Groningen
07.03.2012: Indian Institute of Technology Delhi
17.02.2012: Vellore Institute of Technology
16.02.2012: The Institute of Mathematical Sciences, Chennai
19.12.2011: Tata Institute of Fundamental Research
Formal Definitions and Complexity Results for Trust Relations and Trust Domains
01.04.2011: Nanyang Technological University
31.03.2011: National University of Singapore
21.03.2011: Indian Institute of Technology Delhi
18.02.2011: Mysore Park Workshop, Infosys Campus, Mysore
08.02.2011: The Institute of Mathematical Sciences, Chennai
01.02.2011: Tata Institute of Fundamental Research, Mumbai
19.11.2010: National Institute of Information and Communications Technology, Tokyo
06.09.2010: National Institute of Informatics, Tokyo
19.05.2010: University of Tokyo
An Intuitionistic Foundation for Interactive Computation
23.07.2011: Congress on Logic, Methodology and Philosophy of Science
09.04.2010: University of Tsukuba (Workshop on Symbolic Computation and Software Verification)
08.03.2010: JAIST, Kanazawa (Workshop on Constructive Aspects of Logic and Mathematics)
22.02.2010: Lorentz Center, Leiden (Workshop on Formal Theories of Communication)
A General Definition of Malware
19.11.2010: National Institute of Information and Communications Technology, Tokyo
06.05.2010: Kyushu University
28.04.2010: National Institute of Informatics, Tokyo
17.02.2010: University of Tokyo
20.01.2010: University of Hyderabad (Workshop on Logic for Information Security)
15.01.2010: Nanyang Technological University
15.01.2010: National University of Singapore
22.05.2009: Queensland University of Technology
20.05.2009: University of Wollongong
19.05.2009: University of New South Wales
18.05.2009: Macquarie University
12.05.2009: The Australian National University
08.05.2009: Deakin University
01.05.2009: University of Tsukuba
27.11.2008: Ecole Polytechnique Fédérale de Lausanne (EPFL)
Dolev-Yao Encryption is Urquhart-Routley Implication
11.11.2008: University of Turin
Reducing Provability to Knowledge in Multi-Agent Systems
24.09.2008: Lorentz Center, Leiden (Workshop on Logic and Information Security)
24.06.2008: Indiana University at Bloomington
Modal Logic for Information Security
18.09.2008: University of Bern
Towards Interactive Belief, Knowledge, and Provability: Possible Application to Zero-Knowledge Proofs
31.03.2008: Université du Luxembourg
20.03.2008: Université libre de Bruxelles
11.02.2008: Université Paris XII - Val de Marne
19.12.2007: Imperial College, London
18.12.2007: Cambridge University
14.12.2007: University of Liverpool
12.12.2007: University of Southampton
05.12.2007: Oxford University
25.10.2007: University of Amsterdam
The Intended and Actual Meaning of a Cryptographic Message and Protocol
19.03.2008: Max-Planck Institute for Software Systems, Saarbrücken
adapted talk given with the title: The Purpose of Communication in Distributed Systems
25.10.2007: University of Amsterdam
10.10.2007: Politecnico di Torino
02.10.2007: Ecole Polytechnique, Paris
Animation and Knowledge Programming for the Timed Calculus of Cryptographic Communication
05.10.2007: Ecole Polytechnique, Paris
The Meaning of a Cryptographic Message via Hypothetical Knowledge and Provability
27.09.2007: University of Tsukuba
26.09.2007: University of Tokyo
12.09.2007: JAIST Kanazawa
The "Zero" in Zero-Knowledge Proofs
24.04.2007: Alpine Verification Meeting (Aussois, France)
Knowledge, Evidence, and Proof for Cryptography via Relevance
23.01.2007: University of Bern
Cryptographic Protocol Logic: Adding Probabilistic Polynomial-time
23.10.2006: Loria Nancy
Logical Concepts in Cryptography
09.03.2006: CWI Amsterdam
Cryptographic Protocol Logic: A Synthetic Approach
24.06.2005: ENS Paris

Courses

Ecole Polytechnique Fédérale de Lausanne (EPFL)
Elementary Logics (in French for 1st-year undergraduates), 2004.
Announcement, Memorandum, Introduction, Terminology
Case Studies: [ First-order Logic and Set Theory: 1, 2, 3 ] [ Hoare Logic: 4, 5, 6 ]
Reading lessons: 1, 2, 3, 4, 5
Exercise sessions: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10
References: J. Zahnd. Logique élémentaire: Cours de base pour informaticiens. PPUR, 1998, (2003).
R. D. Tennent. Specifying Software: A Hands-On Introduction. CUP, 2002.

Community Services

International Conference on Distributed Computing and Internet Technology (ICDCIT'14): PC member
Logics for Interactive Computation (satellite workshop of ISLA'12): Organiser
Logics in Security (satellite workshop of ESSLLI'10): PC member

My Co-Authors

Johannes Borgström (Uppsala University)
Julian C. Bradfield (University of Edinburgh)
Christelle Braun (Ecole Polytechnique)
Rajeev Goré (Australian National University)
Olga Grinchtein (Ericsson R&D)
Heiko Ludwig (IBM Watson)
Uwe Nestmann (Technical University Berlin)
Luke O'Connor (Zurich Financial Services)
Eiji Okamoto (University of Tsukuba)
Catuscia Palamidessi (Ecole Polytechnique and INRIA)
Peter Ryan (University of Luxembourg)
Andrey Rybalchenko (Technical University Munich)
Joshua Sack (University of Amsterdam)
Roberto Segala (University of Verona)
Andrea Turrini (University of Verona)

Research Networks

CryptoForma
INRIA Alumni