Sciweavers

4377 search results - page 266 / 876
» Mass problems and randomness
Sort
View
WEWORC
2007
132views Cryptology» more  WEWORC 2007»
15 years 7 months ago
Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme
Abstract. Courtois, Finiasz and Sendrier proposed in 2001 a practical code-based signature scheme. We give a rigorous security analysis of a modified version of this scheme in the...
Léonard Dallot
161
Voted
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
15 years 6 months ago
On Metric Clustering to Minimize the Sum of Radii
Abstract Given an n-point metric (P,d) and an integer k > 0, we consider the problem of covering P by k balls so as to minimize the sum of the radii of the balls. We present a r...
Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. P...
IJNSEC
2008
103views more  IJNSEC 2008»
15 years 6 months ago
General Group Oriented ID-based Cryptosystems with Chosen Plaintext Security
A scheme for general group oriented ID-based cryptosystems is proposed. This scheme allows an authorized subset in the general access structure to cooperatively decrypt the cipher...
Chunxiang Xu, Junhui Zhou, Guozhen Xiao
RSA
2002
75views more  RSA 2002»
15 years 6 months ago
On the expected value of the minimum assignment
: We prove the main conjecture of the paper "On the expected value of the minimum assignment" by Marshall W. Buck, Clara S. Chan, and David P. Robbins [Random Structures ...
Marshall W. Buck, Clara S. Chan, David P. Robbins
ICASSP
2011
IEEE
14 years 10 months ago
Comparative threshold performance study for conditional and unconditional direction-of-arrival estimation
Comparative analysis of the threshold SNR and/or sample support values where genuine maximum likelihood DOA estimation starts to produce “outliers” is conducted for unconditio...
Yuri I. Abramovich, Ben A. Johnson