Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Information security and cryptography

Definitions

Carmit Hazay, Yehuda Lindell

Published Jan 1, 2010• 0 citations
Publisher
DOI
10.1007/978-3-642-14303-8_2

Related papers

Definitions

Eleftherios N. Economou

Springer series in solid-state sciences•Jan 1, 1979•0 citations

Formal definitions of Key Exchange models and the effects of restrictions on adversaries

Nelson Arruda

When defining security for Key Exchange, there are two popular ways to base such definitions. The first is indistinguishable based definitions and the second is simulation based. This thesis will focus on indistinguishable based definitions and how variations on these definitions relate to each other. Emphasis will be placed on the addition of session ids to a key exchange protocol and the effect they have on the definition of security. Lastly, we will briefly study limitations of an adversary for one of the model definitions presented.

•Jan 1, 2005•0 citations

Definitions

Eleftherios N. Economou

Springer series in solid-state sciences•Jan 1, 1983•0 citations

Polynomial Runtime in Simulatability Definitions

Dennis Hofheinz, Jörn Müller‐Quade, Dominique Unruh

We elaborate on the problem of polynomial runtime in simulatability definitions for multiparty computation. First, the need for a new definition is demonstrated by showing which problems occur with common definitions of polynomial runtime. Then, we give a definition which captures in an intuitive manner what it means for a protocol or an adversary to have polynomial runtime. We show that this notion is suitable for simulatability definitions for multiparty computation. In particular, a composition theorem is shown for this notion.

IEEE Computer Security Foundations Workshop (CSFW)•Jul 6, 2005•21 citations

Summary

Benedikt Frieß

Springer theses•Jan 1, 2016•1 citation

Polynomial runtime in simulatability definitions*

Dennis Hofheinz, Jörn Müller‐Quade, Dominique Unruh

We elaborate on the problem of polynomial runtime in simulatability definitions for multi-party computation. First, the need for a new definition is demonstrated by showing which problems occur with common definitions of polynomial runtime. Then, we give a definition which captures in an intuitive manner what it means for a protocol or an adversary to have polynomial runtime. We show that this notion is suitable for simulatability definitions for multi-party computation. In particular, a composition theorem is shown for this notion.

Journal of Computer Security•Oct 12, 2009•2 citations
When defining security for Key Exchange, there are two popular ways to base such definitions. The first is indistinguishable based definitions and the second is simulation based. This thesis will focus on indistinguishable based definitions and how variations on these definitions relate to each other. Emphasis will be placed on the addition of session ids to a key exchange protocol and the effect they have on the definition of security. Lastly, we will briefly study limitations of an adversary for one of the model definitions presented.
We elaborate on the problem of polynomial runtime in simulatability definitions for multiparty computation. First, the need for a new definition is demonstrated by showing which problems occur with common definitions of polynomial runtime. Then, we give a definition which captures in an intuitive manner what it means for a protocol or an adversary to have polynomial runtime. We show that this notion is suitable for simulatability definitions for multiparty computation. In particular, a composition theorem is shown for this notion.
We elaborate on the problem of polynomial runtime in simulatability definitions for multi-party computation. First, the need for a new definition is demonstrated by showing which problems occur with common definitions of polynomial runtime. Then, we give a definition which captures in an intuitive manner what it means for a protocol or an adversary to have polynomial runtime. We show that this notion is suitable for simulatability definitions for multi-party computation. In particular, a composition theorem is shown for this notion.