کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4952199 1442027 2017 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Simplified small exponent test for batch verification
ترجمه فارسی عنوان
آزمون تست ساده برای تایید دسته ای
کلمات کلیدی
تأیید صحت، انعکاس، آزمون کوچک آزمون امضای دیجیتالی،
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
چکیده انگلیسی
The Small Exponent Test (SET) for exponentiation is an essential batch-verification technique that is widely applied. In this paper, we propose a simplified SET that can securely batch-verify n instances with only n−1 randomizing exponents. We show that the structure of the proposed batch test is compact in the sense that it works with a minimal number of randomizing exponents for the SET. Thus, our test offers various advantages. Overall, compared to the original SET, the proposed simplified SET is more efficient for any sized batch instance. In particular, unlike the SET, our proposal performs well even when the size of a batch instance is small, e.g., n=1,2,3, and 4. This feature can be also used to significantly reduce pairing computations in a signature scheme where several pairing equations are verified. In addition, our test can be combined easily and generically with existing batch techniques such as the use of sparse exponents, the bucket test for large batch sizes, or an automated tool to generate a batch algorithm. Finally, with our simplified test, an efficient identification algorithm can be constructed to discover incorrect instances in a batch.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 662, 1 February 2017, Pages 48-58
نویسندگان
, , , , , ,