Searching for authors named "Mike Burmester" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

24 documents found, showing 1 through 10. Next 10 →

Homomorphisms of Secret Sharing Schemes: A Tool for Verifiable Signature Sharing
by Mike Burmester — Eurocrypt'96, pp.96--106. Lecture Notes in Computer Science vol.1070
…Homomorphisms of Secret Sharing Schemes: A Tool for Verifiable Signature Sharing Mike Burmester…
Cited by 3 (0 self) – Add To MetaCart

A critical analysis of models for fault-tolerant and secure computation
by Mike Burmester, Yvo Desmedt — 2003 — Proc. Computer, Network and Information Security
…A Critical Analysis of Models for Fault-Tolerant and Secure Computation Mike Burmester Yvo…
Add To MetaCart

Secure Communication in an Unknown Network Using Certificates
by Mike Burmester, Yvo Desmedt
…Secure communication in an unknown network using certificates Mike Burmester Information…
Cited by 6 (1 self) – Add To MetaCart

Models For Dependable Computation with Multiple Inputs and Some Hardness Results
by Yongge Wang, Yvo Desmedt, Mike Burmester — 2000
…@(email omitted); and Information Security Group Royal Holloway -- University of London Mike Burmester Information Security Group…
Cited by 3 (1 self) – Add To MetaCart

Equitability in Retroactive Data Confiscation versus Proactive Key Escrow
by Yvo Desmedt, Mike Burmester, Jennifer Seberry — 1992 — 4 th International Workshop on Practice and Theory in Public Key Cryptography, PKC2003, Proceedings, LNCS
…Equitability in Retroactive Data Confiscation versus Proactive Key Escrow Yvo Desmedt ⋆1,2 , Mike…
Cited by 2 (1 self) – Add To MetaCart

Using Approximation Hardness to Achieve Dependable Computation
by Mike Burmester, Yvo Desmedt, Yongge Wang — 1998 — In: Proc. of the Second International Conference on Randomization and Approximation Techniques in Computer Science, LNCS 1518
…Using Approximation Hardness to Achieve Dependable Computation ⋆ Mike Burmester 1 , Yvo Desmedt 1…
Cited by 8 (7 self) – Add To MetaCart

Security or Privacy, Must We Choose?
by Mike Burmester, Yvo Desmedt, Rebecca Wright, Alec Yasinsac
… conclude in Section 5. 2 Security Mike Burmester,* Yvo Desmedt,* Rebecca Wright,** Alec Yasinsac…
Cited by 1 (0 self) – Add To MetaCart

Strong Forward Security
by Mike Burmester, Vassilios Chrissikopoulos, Panayiotis Kotzanikolaou, Emmanouil Magkos — 2001 — In: IFIP-SEC ’01 Conference, Kluwer
…STRONG FORWARD SECURITY Mike Burmester Department of Computer Science, Florida State University…
Cited by 3 (1 self) – Add To MetaCart

Computing Functions Of A Shared Secret
by Amos Beimel, Mike Burmester, Yvo Desmedt, Eyal Kushilevitz — 2000
…COMPUTING FUNCTIONS OF A SHARED SECRET AMOS BEIMEL , MIKE BURMESTER y , YVO DESMEDT z…
Cited by 1 (1 self) – Add To MetaCart

Uncoercible e-Bidding Games
by Mike Burmester, Emmanouil Magkos, Vassilios Chrissikopoulos, E. Magkos, V. Chrissikopoulos — 2004 — Electronic Commerce Research
…The notion of uncoercibility was first introduced in e-voting systems to deal with the coercion of voters. However this notion extends to many other e-systems for which the privacy of users must be protected, even if the users wish to undermine their own privacy. In this paper we consider uncoercibl…
Cited by 1 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB