Lenient/Strict Batch Verification in Several Groups(Special Section on Cryptography and Information Security)

スポンサーリンク

概要

• 論文の詳細を見る

• Batch verification is a useful tool in verifying a large number of cryptographic items all at one time. It is especially effective in verifying predicates based on modular exponentiation. In some cases, however the items can be incorrect although they pass batch verification together. Such leniency can be eliminated by checking the domain of each item in advance. With this in mind, we introduce the strict batch verification and investigate if the strict batch verification can remain more effective than separate verification. In this paper, we estimate the efficiency of such strict batch verification in several types of groups, a prime subgroup of Z_p with special/random prime p and prime subgroups defined on elliptic curves over F_p, F_2^m and F_p^m, with are often used in DL-based cryptographic primitives. Our analysis concludes that the efficiency differs greatly depending on the choice of the group and parameters determined by the verifying predicate. Furthermore, we even show that there are some cases where batch verification, regardless of strictness, loses its computational advantage.

• 社団法人電子情報通信学会の論文
• 2003-01-01

著者

• HOSHINO Fumitaka

  NTT Information Sharing Platform Laboratories

• Kobayashi Tetsutaro

  Ntt Information And Communication Systems Laboratories

• Abe Masayuki

  Ntt Information Sharing Platform Laboratories Ntt Corporation

• Hoshino F

  Ntt Information Sharing Platform Laboratories

• Abe Masayuki

  Ntt Information Sharing Platform Laboratories

関連論文

• Candidate One-Way Functions on Non-Supersingular Elliptic Curves(Elliptic Curve Cryptography, Cryptography and Information Security)
• Non-Supersingular Elliptic Curves for Pairing-Based Cryptosystems(Discrete Mathematics and Its Applications)
• Chosen Ciphertext Security with Optimal Ciphertext Overhead
• Flaws in Robust Optimistic Mix-Nets and Stronger Security Notions(Protocol, Cryptography and Information Security)
• Tag-KEM from Set Partial Domain One-Way Permutations
• Flexible-Routing Anonymous Networks Using Optimal Length of Ciphertext(Application)(Cryptography and Information Security)
• Anonymous Hierarchical Identity-Based Encryption with Short Ciphertexts
• Faster MapToPoint on Supersingular Elliptic Curves in Characteristic 3
• 1-out-of-n Signatures from a Variety of Keys (Asymmetric Cipher) (Cryptography and Information Security)
• Fast Modular Inversion Algorithm to Match Any Operation Unit (Special Section on Discrete Mathematics and Its Applications)
• Efficient τ-Adic Sliding Window Method on Elliptic Curve Cryptosystems(Special Section on Cryptography and Information Security)
• M+1-st Price Auction Using Homomorphic Encryption(Special Section on Cryptography and Information Security)
• RFID Privacy Enhanced Protocol for Library Operation (日韓合同ワークショップ 1st Korea-Japan Joint Workshop on Ubiquitous Computing and Networking Systems (ubiCNS 2005))
• Lenient/Strict Batch Verification in Several Groups(Special Section on Cryptography and Information Security)
• Delegation Chains Secure up to Constant Length(Special Section on Cryptography and Information Security)
• Universally Verifiable Mix-Net with Verification Work Independent of the Number of Mix-Servers
• A Cyclic Window Algorithm for Elliptic Curves over OEF(Special Section on Cryptography and Information Security)
• Security of ESIGN-PSS(Information Security)

もっと見る 閉じる

スポンサーリンク