Private Trajectory Intersection Detection Using Grobner Basis
محل انتشار: هفدهمین کنفرانس بین المللی انجمن رمز ایران
سال انتشار: 1399
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 462
فایل این مقاله در 6 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ISCC17_016
تاریخ نمایه سازی: 22 آبان 1399
چکیده مقاله:
In this paper, we present a secure protocol for secure obtaining the intersection of two trajectories. We assume the trajectories of moving objects can be presented with polynomial functions of time. We reduce the problem of obtaining intersection of two trajectories to the problem of obtaining commonroots of polynomials. Then, we propose a secure protocol for obtaining the common roots of two polynomials, which is based on Grobner Basis. We demonstrate the security proof of our proposed protocol based on Ideal/Real Simulation Paradigm. We also present the complexity analysis of our proposed protocol and compare its complexity by the garbled circuit-based protocol for Euclidean Distance Computation of l points.
کلیدواژه ها:
نویسندگان
Motahareh Dehghan
Computer Engineering Department Amirkabir University of Technology Hafez Street, Tehran, Iran
Babak Sadeghiyan
Computer Engineering Department Amirkabir University of Technology Hafez Street, Tehran, Iran
Erfan Khosravian
Mechanical Engineering Department Payame Noor University Lashkarak Highway, Tehran, Iran