Separating IND-CPA and Circular Security for Unbounded Length Key Cycles

Rishab Goyal
Rishab Goyal

IACR Cryptology ePrint Archive, Volume 2017, 2017.

Cited by: 6|Bibtex|Views74
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com

Abstract:

A public key encryption scheme is said to be n-circular secure if no PPT adversary can distinguish between encryptions of an n length key cycle and n encryptions of zero.

Code:

Data:

Your rating :
0

 

Tags
Comments