MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "On Pairing Inversion Problems." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

4 documents found, showing 1 through 4.

ATOM

Simplified Pairing Computation and Security Implications
by Steven D. Galbraith, Colm O hEigeartaigh, Caroline Sheedy — 2006
… problem is proposed and analysed. Our findings support the belief that pairing inversion is a hard…
Cited by 1 (1 self) – Add To MetaCart

An Identity-Based Ring Signature Scheme From Bilinear Pairings
by Chih-yin Lin, Tzong-Chen Wu — 2003 — In Proceedings of the 18th International Conference on Advanced Information Networking and Applications. IEEE Computer Society
… be hard. The inversion of the bilinear pairing should be hard, i.e. the bilinear pairing inversion problem…
Cited by 7 (0 self) – Add To MetaCart

On Evaluation and Training-Set Construction for Duplicate Detection
by Mikhail Bilenko, Raymond J. Mooney — 2003 — PROCEEDINGS OF THE KDD-2003 WORKSHOP ON DATA CLEANING, RECORD LINKAGE, AND OBJECT CONSOLIDATION, WASHINGTON DC
… problem: extremely few non-duplicate pairs are found, and the class distribution of training data…
Cited by 18 (1 self) – Add To MetaCart

Policy-Based Cryptography and Applications
by Walid Bagga Refik, Walid Bagga, Refik Molva — 2005 — In Proceedings of the 9th International Conference on Financial Cryptography and Data Security
…). Given Q,Q ′ ∈ G1 such that Q ′ = x·Q for some x ∈ Z ∗ q: find x – Bilinear Pairing Inversion Problem…
Add To MetaCart

Showing 1 through 4.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB