Jannik Dreier
Jannik Dreier
LORIA, Université de Lorraine, TELECOM Nancy
Verifierad e-postadress på loria.fr - Startsida
TitelCiteras avÅr
Automated symbolic proofs of observational equivalence
D Basin, J Dreier, R Sasse
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications …, 2015
642015
Practical privacy-preserving multiparty linear programming based on problem transformation
J Dreier, F Kerschbaum
2011 IEEE Third International Conference on Privacy, Security, Risk and …, 2011
55*2011
A formal analysis of 5G authentication
D Basin, J Dreier, L Hirschi, S Radomirovic, R Sasse, V Stettler
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications …, 2018
452018
Formal verification of e-auction protocols
J Dreier, P Lafourcade, Y Lakhnech
International Conference on Principles of Security and Trust, 247-266, 2013
342013
A formal taxonomy of privacy in voting protocols
J Dreier, P Lafourcade, Y Lakhnech
2012 IEEE International Conference on Communications (ICC), 6710-6715, 2012
342012
Defining verifiability in e-auction protocols
J Dreier, H Jonker, P Lafourcade
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and …, 2013
302013
Beyond subterm-convergent equational theories in automated verification of stateful protocols
J Dreier, C Duménil, S Kremer, R Sasse
International Conference on Principles of Security and Trust, 117-140, 2017
272017
A framework for analyzing verifiability in traditional and electronic exams
J Dreier, R Giustolisi, A Kassem, P Lafourcade, G Lenzini
International Conference on Information Security Practice and Experience …, 2015
25*2015
Vote-independence: A powerful privacy notion for voting protocols
J Dreier, P Lafourcade, Y Lakhnech
International Symposium on Foundations and Practice of Security, 164-180, 2011
202011
Defining privacy for weighted votes, single and multi-voter coercion
J Dreier, P Lafourcade, Y Lakhnech
European Symposium on Research in Computer Security, 451-468, 2012
192012
Automated unbounded verification of stateful cryptographic protocols with exclusive OR
J Dreier, L Hirschi, S Radomirovic, R Sasse
2018 IEEE 31st Computer Security Foundations Symposium (CSF), 359-373, 2018
162018
Formal analysis of electronic exams
J Dreier, R Giustolisi, A Kassem, P Lafourcade, G Lenzini, PYA Ryan
2014 11th International Conference on Security and Cryptography (SECRYPT), 1-12, 2014
152014
Formal analysis of e-cash protocols
J Dreier, A Kassem, P Lafourcade
e-Business and Telecommunications (ICETE), 2015 12th International Joint …, 2015
142015
On unique decomposition of processes in the applied π-calculus
J Dreier, C Ene, P Lafourcade, Y Lakhnech
International Conference on Foundations of Software Science and …, 2013
122013
A novel approach for reasoning about liveness in cryptographic protocols and its application to fair exchange
M Backes, J Dreier, S Kremer, R Künnemann
2017 IEEE European Symposium on Security and Privacy (EuroS&P), 76-91, 2017
102017
Brandt’s fully private auction protocol revisited
J Dreier, JG Dumas, P Lafourcade
Journal of Computer Security 23 (5), 587-610, 2015
102015
Formally Verifying Flow Properties in Industrial Systems
J Dreier, M Puys, ML Potet, P Lafourcade, JL Roch
82017
Physical zero-knowledge proofs for Akari, Takuzu, Kakuro and KenKen
X Bultel, J Dreier, JG Dumas, P Lafourcade
arXiv preprint arXiv:1606.01045, 2016
62016
Physical zero-knowledge proof for Makaro
X Bultel, J Dreier, JG Dumas, P Lafourcade, D Miyahara, T Mizuki, ...
International Symposium on Stabilizing, Safety, and Security of Distributed …, 2018
42018
Secure auctions without cryptography
J Dreier, H Jonker, P Lafourcade
International Conference on Fun with Algorithms, 158-170, 2014
42014
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20