Sergiu Bursuc
Sergiu Bursuc
postdoctoral researcher, University of Luxembourg
Verifierad e-postadress på uni.lu - Startsida
Titel
Citeras av
Citeras av
År
Caveat coercitor: Coercion-evidence in electronic voting
GS Grewal, MD Ryan, S Bursuc, PYA Ryan
2013 IEEE Symposium on Security and Privacy, 367-381, 2013
662013
Privacy supporting cloud computing: Confichair, a case study
M Arapinis, S Bursuc, M Ryan
International Conference on Principles of Security and Trust, 89-108, 2012
402012
Trivitas: Voters directly verifying votes
S Bursuc, GS Grewal, MD Ryan
International Conference on E-Voting and Identity, 190-207, 2011
272011
Privacy-supporting cloud computing by in-browser key translation
M Arapinis, S Bursuc, M Ryan
Journal of Computer Security 21 (6), 847-880, 2013
182013
Associative-commutative deducibility constraints
S Bursuc, H Comon-Lundh, S Delaune
Annual Symposium on Theoretical Aspects of Computer Science, 634-645, 2007
172007
Protocol security and algebraic properties: Decision results for a bounded number of sessions
S Bursuc, H Comon-Lundh
International Conference on Rewriting Techniques and Applications, 133-147, 2009
152009
Reduction of equational theories for verification of trace equivalence: re-encryption, associativity and commutativity
M Arapinis, S Bursuc, MD Ryan
International Conference on Principles of Security and Trust, 169-188, 2012
132012
Deducibility constraints, equational theory and electronic money
S Bursuc, H Comon-Lundh, S Delaune
Rewriting, Computation and Proof, 196-212, 2007
132007
Deducibility constraints
S Bursuc, H Comon-Lundh, S Delaune
Annual Asian Computing Science Conference, 24-38, 2009
72009
Securing the End-points of the Signal Protocol using Intel SGX based Containers
K Severinsen, C Johansen, S Bursuc
Security Principles and Trust Hotspot 2017, 1, 2017
62017
Private votes on untrusted platforms: models, attacks and provable scheme
S Bursuc, CC Dragan, S Kremer
2019 IEEE European Symposium on Security and Privacy (EuroS&P), 606-620, 2019
42019
Automated verification of dynamic root of trust protocols
S Bursuc, C Johansen, S Xu
International Conference on Principles of Security and Trust, 95-116, 2017
42017
Deducibility constraints and blind signatures
S Bursuc, H Comon-Lundh, S Delaune
Information and Computation 238, 106-127, 2014
22014
Unification and Matching in Separable Theories–technicalities
S Bursuc, C Prisacariu
Technical Report 398, Dept. Info., Univ. Oslo, 2010
22010
Contraintes de déductibilité dans une algčbre quotient: réduction de modčles et applications ā la sécurité
S Bursuc
Thčse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, 2009
22009
Contingent payments on a public ledger: models and reductions for automated verification
S Bursuc, S Kremer
European Symposium on Research in Computer Security, 361-382, 2019
12019
Secure two-party computation in applied pi-calculus: models and verification
S Bursuc
Trustworthy Global Computing, 1-15, 2015
12015
Unification and matching in separable theories
S Bursuc, C Prisacariu
24th International Workshop on Unification (UNIF10), Edimburg, UK, 2010
12010
Contraintes de déductibilité modulo associativitécommutativité
S Bursuc
Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, 2006
12006
Safe enclosures: towards cryptographic techniques for server protection.
S Bursuc, JP Murphy
IACR Cryptol. ePrint Arch. 2013, 819, 2013
2013
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20