Encrypted Cloud Data Mark and Group Search Method Based on Singular Value Decomposition

<div>Time cost of generating trapdoor with different number of groups <svg height="9.39034pt" id="M312" style="vertical-align:-3.42943pt" version="1.1" viewbox="-0.0498162 -5.96091 7.52435 9.39034" width="7.52435pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M546 430L539 434C529 434 505 438 495 440C473 444 450 448 430 448C352 448 265 412 213 366C145 306 96 203 96 103C96 22 135 -12 160 -12C190 -12 238 14 262 32C310 68 368 120 411 184H413C403 117 396 75 384 21C353 -118 325 -158 291 -184C270 -200 241 -205 208 -205C133 -205 90 -164 74 -110C70 -98 58 -100 49 -107C34 -119 23 -140 23 -155C23 -190 74 -261 166 -261C219 -261 280 -233 314 -208C383 -157 446 -79 470 81C491 223 529 388 546 430ZM456 386C452 357 433 283 420 252C402 216 366 174 325 129C288 88 239 56 212 56C192 56 182 77 182 120C182 165 199 242 226 292C256 348 281 377 311 389C327 395 353 402 375 402C408 402 436 394 456 386Z"></path></g></svg> when threshold <svg height="9.49473pt" id="M313" style="vertical-align:-0.2063999pt" version="1.1" viewbox="-0.0498162 -9.28833 43.4561 9.49473" width="43.4561pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M475 507C475 612 440 712 326 712C139 712 23 420 23 215C23 96 58 -12 180 -12C369 -12 475 293 475 507ZM391 522C391 486 387 448 379 394H126C155 538 222 677 310 677C386 677 391 571 391 522ZM373 346C344 193 283 22 189 22C126 22 106 114 106 196C106 243 111 293 118 346H373Z"></path></g><g transform="matrix(.013,0,0,-0.013,10.107,0)"><path d="M535 323V373H52V323H535ZM535 138V188H52V138H535Z"></path></g><g transform="matrix(.013,0,0,-0.013,21.37,0)"><path d="M248 635C97 635 43 457 43 311C43 153 97 -12 247 -12S450 166 450 312C450 466 397 635 248 635ZM246 603C337 603 361 452 361 312S337 20 248 20S132 172 132 313C132 452 156 603 246 603Z"></path></g><g transform="matrix(.013,0,0,-0.013,27.803,0)"><path d="M113 -12C146 -12 170 11 170 46C170 78 146 103 114 103S58 78 58 46C58 11 82 -12 113 -12Z"></path></g><g transform="matrix(.013,0,0,-0.013,30.767,0)"><path d="M244 635C114 635 38 519 38 422C38 317 111 240 217 240C236 240 255 244 277 256L345 292C311 140 203 39 59 15L64 -15C89 -15 150 -5 204 17C339 72 440 202 440 386C440 521 368 635 244 635ZM228 602C326 602 352 479 352 390C352 370 351 347 348 324C327 308 293 296 258 296C174 296 124 369 124 458C124 517 152 602 228 602Z"></path></g><g transform="matrix(.013,0,0,-0.013,37.008,0)"><path d="M249 635C141 635 70 555 70 471C70 401 114 353 179 316C143 294 106 267 90 252C68 231 45 202 45 157C45 50 130 -12 237 -12C322 -12 435 52 435 169C435 256 372 304 303 343C349 374 375 398 383 407C401 429 411 458 411 487C411 569 344 635 249 635ZM238 603C285 603 337 567 337 482C337 422 310 385 276 358C205 393 145 426 145 500C145 552 179 603 238 603ZM248 20C183 20 125 70 125 163C125 218 158 268 206 300C284 261 355 217 355 143C355 66 308 20 248 20Z"></path></g></svg> and the number of documents is 2000.</div>

Mathematical Problems in Engineering

fig6

Figure 6

Figure 6: Encrypted Cloud Data Mark and Group Search Method Based on Singular Value Decomposition 