All-But-Many Lossy Trapdoor Functions

@inproceedings{Hofheinz2011AllButManyLT,
  title={All-But-Many Lossy Trapdoor Functions},
  author={Dennis Hofheinz},
  booktitle={IACR Cryptology ePrint Archive},
  year={2011}
}
We put forward a generalization of lossy trapdoor functions (LTFs). Namely, all-but-many lossy trapdoor functions (ABM-LTFs) are LTFs that are parametrized with tags. Each tag can either be injective or lossy, which leads to an invertible or a lossy function. The interesting property of ABM-LTFs is that it is possible to generate an arbitrary number of lossy tags by means of a special trapdoor, while it is not feasible to produce lossy tags without this trapdoor. Our definition and construction… CONTINUE READING
Highly Cited
This paper has 64 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 43 citations

64 Citations

051015'10'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 64 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 48 references

An efficient reduction from DDH to the rank problem

  • Jorge Villar
  • 2011
Highly Influential
4 Excerpts