Arithmetic Operators for Pairing-Based Cryptography

Beuchat, Jean-Luc; Brisebarre, Nicolas; Detrey, Jérémie; Okamoto, Eiji

doi:10.1007/978-3-540-74735-2_17

Cited by 18 publications

(23 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Finally, we explored the trade-offs involved in the hardware implementation of the modified Tate pairing for both characteristic two and three. Our architectures are based on the unified arithmetic operator introduced in [3], and achieve a better area-time trade-off compared to previously published solutions [10,15,17,19,20,[28][29][30]33].…”

Section: Resultsmentioning

confidence: 99%

“…However, supplementing a pairing coprocessor with dedicated hardware for the EEA is not the most appropriate solution. Computing the inverse of a ∈ F 2 m by means of multiplications and squarings over F 2 m according to Fermat's little theorem and Itoh and Tsujii's work [14] allows one to keep the circuit area as small as possible without impacting too severely on the performances [3]. Since…”

Section: Overall Cost Evaluationsmentioning

confidence: 99%

See 1 more Smart Citation

A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$

Beuchat

Brisebarre

Detrey³

et al. 2008

Pairing-Based Cryptography – Pairing 2008

Self Cite

View full text Add to dashboard Cite

Section: Resultsmentioning

confidence: 99%

Section: Overall Cost Evaluationsmentioning

confidence: 99%

A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$

Beuchat

Brisebarre

Detrey³

et al. 2008

Pairing-Based Cryptography – Pairing 2008

Self Cite

View full text Add to dashboard Cite

“…We define the bilinear pairing takes the form e : EðIF p m Þ Â EðIF p km Þ ! IF Ã p km (the definition given here is from [17], [18]), where p is a prime, m is a positive integer, and k is the embedding degree (or security multiplier). In this case, we utilize an asymmetric pairing e : G G 1 Â G G 2 !…”

Section: Performance Analysis For Cpdp Schemementioning

confidence: 99%

Cooperative Provable Data Possession for Integrity Verification in Multicloud Storage

Zhu

Ahn

et al. 2012

IEEE Trans. Parallel Distrib. Syst.

405

225

View full text Add to dashboard Cite

Abstract-Provable data possession (PDP) is a technique for ensuring the integrity of data in storage outsourcing. In this paper, we address the construction of an efficient PDP scheme for distributed cloud storage to support the scalability of service and data migration, in which we consider the existence of multiple cloud service providers to cooperatively store and maintain the clients' data. We present a cooperative PDP (CPDP) scheme based on homomorphic verifiable response and hash index hierarchy. We prove the security of our scheme based on multiprover zero-knowledge proof system, which can satisfy completeness, knowledge soundness, and zero-knowledge properties. In addition, we articulate performance optimization mechanisms for our scheme, and in particular present an efficient method for selecting optimal parameter values to minimize the computation costs of clients and storage service providers. Our experiments show that our solution introduces lower computation and communication overheads in comparison with noncooperative approaches.

show abstract

“…After the modular reductions, the D partial products and the accumulator have added thanks to a binary tree of adders over Fpm [5], [6], [7]. Consequently, to optimize the critical path of this multi-operand adder, one should choose a parameter D of the form 2n − 1 (typically D = 3, 7, 15 or 31).…”

Section: Table 22 Multiplication Frobenius Map Over Fpmmentioning

confidence: 99%

Secure and Efficient Audit Service Outsourcing for Data Integrity in Clouds

Prakash¹

2014

IJMSR

View full text Add to dashboard Cite

-Cloud-based outsourced storage relieves the client's load for storage management and maintenance by providing a comparably low-cost, scalable, locationindependent platform. Though, the information that clients no longer have physical control of data specifies that they are facing a potentially formidable risk for missing or corrupted data. To avoid the security risks, inspection services are serious to ensure the integrity and availability of outsourced data and to achieve digital forensics and reliability on cloud computing. Provable data possession (PDP), which is a cryptographic method for validating the reliability of data without retrieving it at an untrusted server, can be used to realize audit services. In this project, profiting from the interactive zero-knowledge proof system, the construction of an interactive PDP protocol to prevent the fraudulence of prover (soundness property) and the leakage of verified data (zero knowledge property).To prove that our construction holds these properties based on the computation Diffie-Hellman assumption and the rewindable black-box knowledge extractor. An efficient mechanism on probabilistic queries and periodic verification is proposed to reduce the audit costs per verification and implement abnormal detection timely. Also, we present an efficient method for choosing an optimal parameter value to reduce computational overheads of cloud audit services.

show abstract

Arithmetic Operators for Pairing-Based Cryptography

Cited by 18 publications

References 31 publications

A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$

A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$

Cooperative Provable Data Possession for Integrity Verification in Multicloud Storage

Secure and Efficient Audit Service Outsourcing for Data Integrity in Clouds

Contact Info

Product

Resources

About