1. What are the contributions mentioned in the paper "Batch pairing delegation⋆" ?
In this paper, the authors introduce the concept of, and construct several protocols for, batch pairing delegation, which offers significantly improved efficiency over multiple runs of state-of-the-art ( non-batch ) delegation protocols.. The authors prove the security of their proposed protocols in the model they formalized for batch pairing delegation.. The authors propose a taxonomy that classifies pairings into seven types to assist in choosing the right delegation protocol.. Finally, the authors propose a novel application of pairing delegation in trusted computing — they show how pairing delegation can be leveraged to build a secure coprocessor for pairing computation more cost-effectively.
read more
2. What type of pairings are common in the decryption algorithm?
Type-PVSC pairings have a public variable point and a secret constant point, and commonly appear in the decryption algorithm, in which the decryption key is the secret constant and the ciphertext contributes to the public variable.
read more
3. How many times does Ron compute SMs and EXPs?
if the authors ignore the computation of G1/G2 point additions and GT multiplications (as their costs are dominated by the costs of the computation of G1/G2 scalar multiplication and GT exponentiation respectively), the speed up ranges from 1.3 to 4, depending on the relative speed of computing SMs and EXPs.
read more
4. What was the machine used for the experiments?
The machine the authors used for the experiments was a Lenovo T60 laptop PC with an Intel dual-core 2GHz CPU and 1.5GB of Ram, running Ubuntu 6.10.
read more
