Three's Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE

@inproceedings{Alamati2016ThreesCT,
  title={Three's Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE},
  author={Navid Alamati and Chris Peikert},
  booktitle={IACR Cryptology ePrint Archive},
  year={2016}
}
Informally, a public-key encryption scheme is k-circular secure if a cycle of k encrypted secret keys (Encpk1(sk2),Encpk2(sk3), . . . ,Encpkk(sk1)) is indistinguishable from encryptions of zeros. Circular security has applications in a wide variety of settings, ranging from security of symbolic protocols to fully homomorphic encryption. A fundamental question is whether standard security notions like IND-CPA/CCA imply k-circular security. For the case k = 2, several works over the past years… CONTINUE READING

Topics

Statistics

01020201620172018
Citations per Year

Citation Velocity: 8

Averaging 8 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.