Results 1  10
of
1,183
A computational approach to edge detection
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1986
"... This paper describes a computational approach to edge detection. The success of the approach depends on the definition of a comprehensive set of goals for the computation of edge points. These goals must be precise enough to delimit the desired behavior of the detector while making minimal assumpti ..."
Abstract

Cited by 4675 (0 self)
 Add to MetaCart
This paper describes a computational approach to edge detection. The success of the approach depends on the definition of a comprehensive set of goals for the computation of edge points. These goals must be precise enough to delimit the desired behavior of the detector while making minimal
Proofs of partial knowledge and simplified design of witness hiding protocols
, 1994
"... Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S on n participants. Then under certain assumptions on P and S, we show how to transform P into a witness indistinguishab ..."
Abstract

Cited by 335 (14 self)
 Add to MetaCart
Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S on n participants. Then under certain assumptions on P and S, we show how to transform P into a witness
On the Size of Shares for Secret Sharing Schemes
 Journal of Cryptology
"... A secret sharing scheme permits a secret to be shared among participants in such a way that only qualified subsets of participants can recover the secret, but any nonqualified subset has absolutely no information on the secret. The set of all qualified subsets defines the access structure to the se ..."
Abstract

Cited by 78 (8 self)
 Add to MetaCart
A secret sharing scheme permits a secret to be shared among participants in such a way that only qualified subsets of participants can recover the secret, but any nonqualified subset has absolutely no information on the secret. The set of all qualified subsets defines the access structure
Minimal Codewords and Secret Sharing
 Proceedings of the 6th Joint SwedishRussian International Workshop on Information Theory
, 1993
"... : The use of a linear code to "split" secrets into equalsize shares is considered. The determination of which sets of shares can be used to obtain the secret leads to the apparently new notion of minimal codewords in a linear code. It is shown that the minimal codewords in the dual code c ..."
Abstract

Cited by 51 (1 self)
 Add to MetaCart
: The use of a linear code to "split" secrets into equalsize shares is considered. The determination of which sets of shares can be used to obtain the secret leads to the apparently new notion of minimal codewords in a linear code. It is shown that the minimal codewords in the dual code
Decomposition Constructions for Secret Sharing Schemes
 IEEE Trans. Inform. Theory
, 1998
"... The purpose of this paper is to decribe a very powerful decomposition construction for perfect secret sharing schemes. We give several applications of the construction, and improve previous results by showing that for any graph G of maximum degree d, there is a perfect secret sharing scheme for G w ..."
Abstract

Cited by 40 (4 self)
 Add to MetaCart
and Terminology Informally, a secret sharing scheme is a method of sharing a secret key K among a finite set of participants in such a way that certain specified subsets of participants can compute the secret key K. The value K is chosen by a special participant called the dealer. We will use the following
On Multiplicative Linear Secret Sharing Schemes
 INDOCRYPT’2003, LNCS
"... Abstract. We consider both informationtheoretic and cryptographic settings for MultiParty Computation (MPC), based on the underlying linear secret sharing scheme. Our goal is to study the Monotone Span Program (MSP), that is the result of local multiplication of shares distributed by two given MSP ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. We consider both informationtheoretic and cryptographic settings for MultiParty Computation (MPC), based on the underlying linear secret sharing scheme. Our goal is to study the Monotone Span Program (MSP), that is the result of local multiplication of shares distributed by two given
Secret Sharing
"... Secret sharing • Method for dividing a secret S into n pieces of information (shares or shadows) s1, s2,..., sn, where each si does not reveal anything about S. • The shares can be distributed among a group of participants or kept by a single person (depending on the purpose of the computation). • W ..."
Abstract
 Add to MetaCart
to recover the secret. • Monotone: if a subset W of the set of participants is allowed to recover the secret, any superset of W is also allowed. • n: total number of participants (shares) • k: minimal number of participants (shares) needed to recover the secret. Properties (*) Possibility to add or remove
On secret sharing schemes, matroids and polymatroids
 Journal of Mathematical Cryptology
"... The complexity of a secret sharing scheme is defined as the ratio between the maximum length of the shares and the length of the secret. The optimization of this parameter for general access structures is an important and very difficult open problem in secret sharing. We explore in this paper the co ..."
Abstract

Cited by 18 (4 self)
 Add to MetaCart
The complexity of a secret sharing scheme is defined as the ratio between the maximum length of the shares and the length of the secret. The optimization of this parameter for general access structures is an important and very difficult open problem in secret sharing. We explore in this paper
A new memory monitoring scheme for memoryaware scheduling and partitioning
, 2002
"... We propose a low overhead, online memory monitoring scheme utilizing a set of novel hardware counters. The counters indicate the marginal gain in cache hits as the size of the cache is increased, which gives the cache missrate as a function of cache size. Using the counters, we describe a scheme t ..."
Abstract

Cited by 149 (2 self)
 Add to MetaCart
We propose a low overhead, online memory monitoring scheme utilizing a set of novel hardware counters. The counters indicate the marginal gain in cache hits as the size of the cache is increased, which gives the cache missrate as a function of cache size. Using the counters, we describe a scheme
Results 1  10
of
1,183