Results 1  10
of
50,543
ON COMPUTATIONAL INTRACTABILITY ASSUMPTIONS IN CRYPTOGRAPHY
, 2011
"... In cryptographic protocols, honest parties would prefer that their security is assured even in presence of adversarial parties who have unbounded computational power. Information theoretic secure realization of cryptographic primitives provides such guarantees; but for most tasks such strong securit ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
for efficient algorithms, are called computational intractability assumptions. In this work, we motivate a study of computational intractability assumptions which is goal driven and lends support to the fundamental nature of some of the traditional assumptions beyond being historical accidents. Secure multi
On the Computational Intractability of Analytic Tableau Methods
"... The method of analytic tahlmwx is HismmrH with respect to the notion of computational complexity. The dan of formulas that wu fint identified to be intractable for the tableau method k examined, and an explicit proof of this intractability b presented. A minor addition (factoring) that lead * to fas ..."
Abstract
 Add to MetaCart
The method of analytic tahlmwx is HismmrH with respect to the notion of computational complexity. The dan of formulas that wu fint identified to be intractable for the tableau method k examined, and an explicit proof of this intractability b presented. A minor addition (factoring) that lead
Cryptographic Complexity Classes and Computational Intractability Assumptions
"... Which computational intractability assumptions are inherent to cryptography? We present a broad framework to pose and investigate this question. We first aim to understand the “cryptographic complexity ” of various tasks, independent of any computational assumptions. In our framework the cryptograph ..."
Abstract
 Add to MetaCart
Which computational intractability assumptions are inherent to cryptography? We present a broad framework to pose and investigate this question. We first aim to understand the “cryptographic complexity ” of various tasks, independent of any computational assumptions. In our framework
Secure Information Hiding based on Computationally Intractable Problems
"... Abstract. 1 In this work, a method for proving copyright ownership is presented that is based on Zero Knowledge Interactive Proof (ZKIP) protocols for computationally intractable problems. The utilized problem is the 3coloring problem, which consists in assigning one of three available colors to th ..."
Abstract
 Add to MetaCart
Abstract. 1 In this work, a method for proving copyright ownership is presented that is based on Zero Knowledge Interactive Proof (ZKIP) protocols for computationally intractable problems. The utilized problem is the 3coloring problem, which consists in assigning one of three available colors
Sufficient Conditions for the Computational Intractability of Generic Group Problems
"... Abstract. The generic group model is a valuable methodology for analysing the computational hardness some numbertheoretic problems used in cryptography. Although generic hardness proofs exhibit many similarities, still the computational intractability of every newly introduced problem needs to be p ..."
Abstract
 Add to MetaCart
Abstract. The generic group model is a valuable methodology for analysing the computational hardness some numbertheoretic problems used in cryptography. Although generic hardness proofs exhibit many similarities, still the computational intractability of every newly introduced problem needs
An Information Hiding Method based on Computational Intractable Problems ⋆
"... This paper presents an information hiding method that can be used for proving copyright ownership of a digital object. In contrast with other methods, the identity of the owner of the object is proved by the owner’s ability to demonstrate knowledge of a certain property of the signature. The method ..."
Abstract
 Add to MetaCart
utilizes Zero Knowledge Interactive Proof (ZKIP) protocols for computationally intractable, or NPcomplete, problems and in particular for the 3coloring problem. This problem requires an assignment of a color out of three available colors to the vertices of a graph so that no two adjacent vertices have
Multiparty unconditionally secure protocols
 In STOC ’88: Proceedings of the twentieth annual ACM symposium on Theory of computing
, 1988
"... Under the assumption that each pair of participants em communieatc secretly, we show that any reasonable multiparty protwol can be achieved if at least Q of the Participants am honest. The secrecy achieved is unconditional, It does not rely on any assumption about computational intractability. 1. ..."
Abstract

Cited by 556 (12 self)
 Add to MetaCart
Under the assumption that each pair of participants em communieatc secretly, we show that any reasonable multiparty protwol can be achieved if at least Q of the Participants am honest. The secrecy achieved is unconditional, It does not rely on any assumption about computational intractability. 1.
Sufficient Conditions for Computational Intractability Regarding Generic Algorithms
"... Abstract. The generic group model is a valuable methodology for analyzing the computational hardness of the numbertheoretic problems used in cryptography. Although generic hardness proofs exhibit many similarities, still the computational intractability of every newly introduced problem needs to be ..."
Abstract
 Add to MetaCart
Abstract. The generic group model is a valuable methodology for analyzing the computational hardness of the numbertheoretic problems used in cryptography. Although generic hardness proofs exhibit many similarities, still the computational intractability of every newly introduced problem needs
Parameterized Complexity: A Framework for Systematically Confronting Computational Intractability
 DIMACS Series in Discrete Mathematics and Theoretical Computer Science
, 1997
"... In this paper we give a programmatic overview of parameterized computational complexity in the broad context of the problem of coping with computational intractability. We give some examples of how fixedparameter tractability techniques can deliver practical algorithms in two different ways: (1) by ..."
Abstract

Cited by 87 (16 self)
 Add to MetaCart
In this paper we give a programmatic overview of parameterized computational complexity in the broad context of the problem of coping with computational intractability. We give some examples of how fixedparameter tractability techniques can deliver practical algorithms in two different ways: (1
Cryptographic complexity classes and computational intractability assumptions
"... Which computational complexity assumptions are inherent to cryptography? We present a broad framework to pose and investigate this question. We first aim to understand the “cryptographic complexity ” of various tasks, independent of any computational assumptions. In our framework the cryptographic t ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Which computational complexity assumptions are inherent to cryptography? We present a broad framework to pose and investigate this question. We first aim to understand the “cryptographic complexity ” of various tasks, independent of any computational assumptions. In our framework the cryptographic
Results 1  10
of
50,543