Sciweavers

83 search results - page 1 / 17
» The Gap-Problems: A New Class of Problems for the Security o...
Sort
View
PKC
2001
Springer
95views Cryptology» more  PKC 2001»
13 years 9 months ago
The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes
This paper introduces a novel class of computational problems, the gap problems, which can be considered as a dual to the class of the decision problems. We show the relationship a...
Tatsuaki Okamoto, David Pointcheval
IJNSEC
2007
131views more  IJNSEC 2007»
13 years 4 months ago
An Asymmetric Cryptographic Key Assignment Scheme for Access Control in Tree Structural Hierarchies
In a hierarchical structure, a user in a security class has access to information items of another class if and only if the former class is a predecessor of latter. Based upon cry...
Debasis Giri, Parmeshwary Dayal Srivastava
IACR
2011
126views more  IACR 2011»
12 years 4 months ago
On Enumeration of Polynomial Equivalence Classes and Their Application to MPKC
The Isomorphism of Polynomials (IP) is one of the most fundamental problems in multivariate public key cryptography (MPKC). In this paper, we introduce a new framework to study th...
Dongdai Lin, Jean-Charles Faugère, Ludovic ...
ISPEC
2005
Springer
13 years 10 months ago
A New Class of Codes for Fingerprinting Schemes
Abstract. In this paper we discuss the problem of collusion secure fingerprinting. In the first part of our contribution we prove the existence of equidistant codes that can be u...
Marcel Fernandez, Miguel Soriano, Josep Cotrina Na...
CRYPTO
2003
Springer
132views Cryptology» more  CRYPTO 2003»
13 years 10 months ago
On Cryptographic Assumptions and Challenges
We deal with computational assumptions needed in order to design secure cryptographic schemes. We suggest a classi£cation of such assumptions based on the complexity of falsifying...
Moni Naor