default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSergiu Bursuc
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Sevdenur Baloglu
, Sergiu Bursuc, Sjouke Mauw, Jun Pang:
Formal Verification and Solutions for Estonian E-Voting. AsiaCCS 2024- [c18]Sergiu Bursuc, Reynaldo Gil Pons, Sjouke Mauw, Rolando Trujillo-Rasua:
Software-Based Memory Erasure with Relaxed Isolation Requirements. CSF 2024: 1-16 - [i10]Sergiu Bursuc, Reynaldo Gil Pons, Sjouke Mauw, Rolando Trujillo-Rasua:
Software-Based Memory Erasure with relaxed isolation requirements: Extended Version. CoRR abs/2401.06626 (2024) - 2023
- [c17]Sergiu Bursuc, Ross Horne, Sjouke Mauw, Semen Yurkov:
Provably Unlinkable Smart Card-based Payments. CCS 2023: 1392-1406 - [c16]Sevdenur Baloglu, Sergiu Bursuc, Sjouke Mauw, Jun Pang:
Election Verifiability in Receipt-Free Voting Protocols. CSF 2023: 59-74 - [i9]Sergiu Bursuc, Ross Horne, Sjouke Mauw, Semen Yurkov:
Provably Unlinkable Smart Card-based Payments. CoRR abs/2309.03128 (2023) - 2022
- [c15]Sergiu Bursuc, Sjouke Mauw:
Contingent payments from two-party signing and verification for abelian groups. CSF 2022: 195-210 - [i8]Sergiu Bursuc, Sjouke Mauw:
Contingent payments from two-party signing and verification for abelian groups. IACR Cryptol. ePrint Arch. 2022: 719 (2022) - 2021
- [c14]Sevdenur Baloglu, Sergiu Bursuc, Sjouke Mauw, Jun Pang:
Election Verifiability Revisited: Automated Security Proofs and Attacks on Helios and Belenios. CSF 2021: 1-15 - [c13]Sevdenur Baloglu, Sergiu Bursuc, Sjouke Mauw, Jun Pang:
Provably Improving Election Verifiability in Belenios. E-VOTE-ID 2021: 1-16 - [i7]Sevdenur Baloglu, Sergiu Bursuc, Sjouke Mauw, Jun Pang:
Provably Improving Election Verifiability in Belenios. IACR Cryptol. ePrint Arch. 2021: 1201 (2021) - 2020
- [i6]Sevdenur Baloglu, Sergiu Bursuc, Sjouke Mauw, Jun Pang:
Election Verifiability Revisited: Automated Security Proofs and Attacks on Helios and Belenios. IACR Cryptol. ePrint Arch. 2020: 982 (2020)
2010 – 2019
- 2019
- [c12]Sergiu Bursuc, Steve Kremer:
Contingent Payments on a Public Ledger: Models and Reductions for Automated Verification. ESORICS (1) 2019: 361-382 - [c11]Sergiu Bursuc, Constantin Catalin Dragan, Steve Kremer:
Private Votes on Untrusted Platforms: Models, Attacks and Provable Scheme. EuroS&P 2019: 606-620 - [i5]Sergiu Bursuc, Steve Kremer:
Contingent payments on a public ledger: models and reductions for automated verification. IACR Cryptol. ePrint Arch. 2019: 443 (2019) - 2017
- [c10]Sergiu Bursuc, Christian Johansen, Shiwei Xu:
Automated Verification of Dynamic Root of Trust Protocols. POST 2017: 95-116 - [i4]Sergiu Bursuc, Christian Johansen, Shiwei Xu:
Automated verification of dynamic root of trust protocols (long version). CoRR abs/1701.08676 (2017) - 2015
- [c9]Sergiu Bursuc:
Secure Two-Party Computation in Applied Pi-Calculus: Models and Verification. TGC 2015: 1-15 - [i3]Sergiu Bursuc:
Secure two-party computation in applied pi-calculus: models and verification. IACR Cryptol. ePrint Arch. 2015: 782 (2015) - 2014
- [j2]Sergiu Bursuc, Hubert Comon-Lundh, Stéphanie Delaune:
Deducibility constraints and blind signatures. Inf. Comput. 238: 106-127 (2014) - 2013
- [j1]Myrto Arapinis, Sergiu Bursuc, Mark Ryan:
Privacy-supporting cloud computing by in-browser key translation. J. Comput. Secur. 21(6): 847-880 (2013) - [c8]Gurchetan S. Grewal, Mark Dermot Ryan, Sergiu Bursuc, Peter Y. A. Ryan:
Caveat Coercitor: Coercion-Evidence in Electronic Voting. IEEE Symposium on Security and Privacy 2013: 367-381 - [i2]Shiwei Xu, Sergiu Bursuc, Julian P. Murphy:
New abstractions in applied pi-calculus and automated verification of protected executions. IACR Cryptol. ePrint Arch. 2013: 686 (2013) - [i1]Sergiu Bursuc, Julian P. Murphy:
Safe enclosures: towards cryptographic techniques for server protection. IACR Cryptol. ePrint Arch. 2013: 819 (2013) - 2012
- [c7]Myrto Arapinis, Sergiu Bursuc, Mark Ryan:
Privacy Supporting Cloud Computing: ConfiChair, a Case Study. POST 2012: 89-108 - [c6]Myrto Arapinis, Sergiu Bursuc, Mark Dermot Ryan:
Reduction of Equational Theories for Verification of Trace Equivalence: Re-encryption, Associativity and Commutativity. POST 2012: 169-188 - 2011
- [c5]Sergiu Bursuc, Gurchetan S. Grewal, Mark Dermot Ryan:
Trivitas: Voters Directly Verifying Votes. VoteID 2011: 190-207
2000 – 2009
- 2009
- [c4]Sergiu Bursuc, Hubert Comon-Lundh, Stéphanie Delaune:
Deducibility Constraints. ASIAN 2009: 24-38 - [c3]Sergiu Bursuc, Hubert Comon-Lundh:
Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions. RTA 2009: 133-147 - 2007
- [c2]Sergiu Bursuc, Hubert Comon-Lundh, Stéphanie Delaune:
Deducibility Constraints, Equational Theory and Electronic Money. Rewriting, Computation and Proof 2007: 196-212 - [c1]Sergiu Bursuc, Hubert Comon-Lundh, Stéphanie Delaune:
Associative-Commutative Deducibility Constraints. STACS 2007: 634-645
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
