Asymptotically Compact Adaptively Secure Lattice IBEs and Verifiable Random Functions via Generalized Partitioning Techniques.

Published in: CRYPTO (3) (2017)

Keyphrases

secret sharing
uniformly distributed
chosen plaintext
sample size
asymptotically optimal
data sets
image segmentation
upper bound
sufficient conditions
concept lattice
control parameters
graph partitioning
multi party
secret sharing scheme
approximation operators