Results 1  10
of
238
A Generalized Sequential Sign Detector for Binary Hypothesis Testing
, 1998
"... It is known that for fixed error probabilities sequential signal detection based on the sequential probability ratio test (SPRT) is optimum in terms of the average number of signal samples for detection. But, often suboptimal detectors like the sequential sign detector are preferred over the optima ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
, a generalized sequential sign detector for detecting binary signals in stationary, first order Markov dependent noise is studied. Under iid assumptions, this reduces to the usual sequential sign detector. The optimal decision thresholds and the average sample number for the test to terminate
Efficient sequential aggregate signed data. In
 Advances in Cryptology – EUROCRYPT 2008,
, 2008
"... Abstract We generalize the concept of sequential aggregate signatures (SAS), proposed by Lysyanskaya, Micali, Reyzin, and Shacham at Eurocrypt 2004, to a new primitive called sequential aggregate signed data (SASD) that tries to minimize the total amount of transmitted data, rather than just signat ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
Abstract We generalize the concept of sequential aggregate signatures (SAS), proposed by Lysyanskaya, Micali, Reyzin, and Shacham at Eurocrypt 2004, to a new primitive called sequential aggregate signed data (SASD) that tries to minimize the total amount of transmitted data, rather than just
Truncated Sequential CFAR Detectors Using Weighted Sign and Weighted Conditional Sign Tests
"... ABSTRACT: In this paper we propose truncated sequential constant false alarm rate ( CFAR) detectors which are approximations of the optimum sequential sign and sequential conditional sign detectors. The particular approximations used here allow exact evaluation of the performances. These detectors ..."
Abstract
 Add to MetaCart
ABSTRACT: In this paper we propose truncated sequential constant false alarm rate ( CFAR) detectors which are approximations of the optimum sequential sign and sequential conditional sign detectors. The particular approximations used here allow exact evaluation of the performances. These detectors
On the security of joint signature and encryption
, 2002
"... We formally study the notion of a joint signature and encryption in the publickey setting. We refer to this primitive as signcryption, adapting the terminology of [35]. We present two definitions for the security of signcryption depending on whether the adversary is an outsider or a legal user of t ..."
Abstract

Cited by 150 (6 self)
 Add to MetaCart
of the system. We then examine generic sequential composition methods of building signcryption from a signature and encryption scheme. Contrary to what recent results in the symmetric setting [5, 22] might lead one to expect, we show that classical “encryptthensign” (EtS) and “signthenencrypt” (StE) methods
EVALUATION OF THE SIGN DETECTOR FOR DCT DOMAIN WATERMARK DETECTION
, 2012
"... Reordering by the rule of decreased absolute amplitudes, the discrete cosine transformation (DCT) coefficients of an image are approximately modeled as dichotomous noise. Based on this assumption, it is interesting to note that the classical multiplicative embedding method can be transformed into ..."
Abstract
 Add to MetaCart
into an additive embedding rule, which accords with the signal processing problem of detecting a known weak signal in additive nonGaussian noise. Then, following the generalized NeymanPearson lemma, a locally optimum detector, named the sign detector, is introduced to distinguish the correct watermark from
Asymptotic Analysis of a Sequential Detector for Markovdependent Observations
"... In this paper, we discuss the asymptotic performance of the sequential sign detector for Markovdependent observations. The received signal samples are assumed to be from a stationary, first order Markov process. Both, lower and upper bounds on the average time for detection are computed. A renewal t ..."
Abstract
 Add to MetaCart
In this paper, we discuss the asymptotic performance of the sequential sign detector for Markovdependent observations. The received signal samples are assumed to be from a stationary, first order Markov process. Both, lower and upper bounds on the average time for detection are computed. A renewal
An Analysis of the MedianShift Sign Detector Under Various Noise Distributions
, 1998
"... We propose a new detector of which the basis is on the medianshift (MS) sign: the medianshift sign (MSS) detector is a generalization of the classical (standard) sign detector. We obtain the finite sample size and asymptotic optimum MS values for various noise probability density functions (pdfs). ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We propose a new detector of which the basis is on the medianshift (MS) sign: the medianshift sign (MSS) detector is a generalization of the classical (standard) sign detector. We obtain the finite sample size and asymptotic optimum MS values for various noise probability density functions (pdfs
Effective and sequential definition by cases on the reals via infinite signeddigit numerals
 In Third Workshop on Computation and Approximation (Comprox III), volume 13 of Electronic Notes in Theoretical Computer Science
, 1998
"... The lexicographical and numerical orders on infinite signeddigit numerals are unrelated. However, we show that there is a computable normalization operation on pairs of signeddigit numerals such that for normal pairs the two orderings coincide. In particular, one can always assume without loss of ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
of generality that any two numerals that denote the same number are themselves the same. We apply the ordernormalization operator to easily obtain an effective and sequential definitionbycases scheme in which the cases consist of inequalities between real numbers. Key words: Real number computation, parallel
Multisensor Distributed Sequential Detection
, 1994
"... A conceptual generalization of the Wald's sequential probability ratio test (SPRT) to a decentralized environment is presented. The local tests are chosen to be SPRT'S, which quantize the temporally iid observations into three levels for transmission to the fusion detector. Spatial indepen ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
A conceptual generalization of the Wald's sequential probability ratio test (SPRT) to a decentralized environment is presented. The local tests are chosen to be SPRT'S, which quantize the temporally iid observations into three levels for transmission to the fusion detector. Spatial
ON NONPARAMETRIC SEQUENTIAL POINT ESTIMATION OF LOCATION BASED ON GENERAL RANK ORDER STATISTICS*
, 1979
"... A nonparametric sequential procedure for the point estimation of location of an unspecified (symmetric) distribution based on a general class of onesample (signed) rank order statistics is considered and its asymptotic theory is developed. The asymptotic riskefficiency of the proposed procedure is ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
A nonparametric sequential procedure for the point estimation of location of an unspecified (symmetric) distribution based on a general class of onesample (signed) rank order statistics is considered and its asymptotic theory is developed. The asymptotic riskefficiency of the proposed procedure
Results 1  10
of
238