Results 1  10
of
31
Polynomial Runtime in Simulatability Definitions
 IN 18TH IEEE COMPUTER SECURITY FOUNDATIONS WORKSHOP, PROCEEDINGS OF CSFW 2005
, 2005
"... 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 m ..."
Abstract

Cited by 15 (7 self)
 Add to MetaCart
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
Polynomial Runtime in Simulatability Definitions
"... Abstract We elaborate on the problem of polynomial runtime insimulatability definitions for multiparty computation. First, the need for a new definition is demonstrated by showingwhich problems occur with common definitions of polynomial runtime. Then, we give a definition which captures inan intui ..."
Abstract
 Add to MetaCart
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, acomposition theorem is shown for this notion.
The reactive simulatability (RSIM) framework for asynchronous systems
 Information and Computation
, 2007
"... We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that preserves security in a general cryptographic sense. Reactive means that the system can interact with its users multiple times ..."
Abstract

Cited by 37 (6 self)
 Add to MetaCart
is the definition of the reactive runtime via a realization by Turing machines such that notions like polynomialtime are composable. The simple complexity of the transition functions of the automata is not composable. As specializations of this model we define securityspecific concepts, in particular a separation
Simulatable Security and Polynomially Bounded Concurrent Composability
 In IEEE Symposium on Security and Privacy, Proceedings of SSP ’06
, 2006
"... Simulatable security is a security notion for multiparty protocols that implies strong composability features. The main definitional flavours of simulatable security are standard simulatability, universal simulatability, and blackbox simulatability. All three come in "computational," & ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Simulatable security is a security notion for multiparty protocols that implies strong composability features. The main definitional flavours of simulatable security are standard simulatability, universal simulatability, and blackbox simulatability. All three come in "
Polynomial Runtime and Composability
, 2007
"... In cryptographic protocols, protocol parties and adversaries should only be allowed to perform computationally feasible actions. This can be done by restricting these entities to polynomialtime complexity. However, already to find a good definition for polynomial time complexity for protocols prove ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In cryptographic protocols, protocol parties and adversaries should only be allowed to perform computationally feasible actions. This can be done by restricting these entities to polynomialtime complexity. However, already to find a good definition for polynomial time complexity for protocols
Calculating polynomial runtime properties
 Proceedings of the Third Asian Symposium on Programming Languages and Systems (APLAS ’05), volume 3780 of Lecture Notes in Computer Science
, 2005
"... Abstract. Affine sizechange analysis has been used for termination analysis of eager functional programming languages. The same style of analysis is also capable of compactly recording and calculating other properties of programs, including their runtime, maximum stack depth, and (relative) path ti ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
degree polynomial costs. An extension to the technique allows the calculation of some classes of exponentialcost programs. We demonstrate the new technique by recording the calculation in numbersoffunction (or procedure) calls for a simple functional definition language, but it can also be applied to imperative
ABSTRACT On Fairness in Simulatabilitybased Cryptographic Systems
"... Simulatability constitutes the cryptographic notion of a secure refinement and has asserted its position as one of the fundamental concepts of modern cryptography. Although simulatability carefully captures that a distributed protocol does not behave any worse than an ideal specification, it however ..."
Abstract
 Add to MetaCart
on infinite runs and eventual message delivery is not suited for reasoning about polynomialtime, cryptographic systems, we propose a new definition of fairness that enforces the delivery of messages after a polynomial number of steps. We provide strengthened variants of this definition by granting
Precise Time and Space Simulatable ZeroKnowledge
"... Traditionally, the definition of zeroknowledge states that an interactive proof of x ∈ L provides zero (additional) knowledge if the view of any polynomialtime verifier can be reconstructed by a polynomialtime simulator. Since this definition only requires that the worstcase runningtime of the ..."
Abstract
 Add to MetaCart
Traditionally, the definition of zeroknowledge states that an interactive proof of x ∈ L provides zero (additional) knowledge if the view of any polynomialtime verifier can be reconstructed by a polynomialtime simulator. Since this definition only requires that the worstcase running
Polynomial Fairness and Liveness
 In 15th IEEE Computer Security Foundations Workshop, Proceedings of CSFW 2002
, 2002
"... Important properties of many protocols are liveness or availability, i.e., that something good happens now and then. In asynchronous scenarios these properties obviously depend on the scheduler, which is usually considered to be fair in this case. Unfortunately, the standard definitions of fairness ..."
Abstract

Cited by 16 (8 self)
 Add to MetaCart
with arbitrary cryptographic protocols. Furthermore, our definitions provide a link to the common approach of simulatability which is used throughout modern cryptography, and we show that polynomial liveness is maintained under simulatability. As an example we present an abstract specification and a secure
Polynomial Runtime Bounds for FixedRank Unsupervised LeastSquares Classification
"... Maximum margin clustering can be regarded as the direct extension of support vector machines to unsupervised learning scenarios. The goal is to partition unlabeled data into two classes such that a subsequent application of a support vector machine would yield the overall best result (with respect t ..."
Abstract
 Add to MetaCart
of the original problem definition have been proposed in the literature. In this work, we consider one of these variants, called unsupervised regularized leastsquares classification, which is based on the square loss, and develop polynomial upper runtime bounds for the induced combinatorial optimization task
Results 1  10
of
31