Homomorphic public-key cryptosystems and encrypting boolean circuits

Computer Science – Cryptography and Security

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

In this paper homomorphic cryptosystems are designed for the first time over
any finite group. Applying Barrington's construction we produce for any boolean
circuit of the logarithmic depth its encrypted simulation of a polynomial size
over an appropriate finitely generated group.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Homomorphic public-key cryptosystems and encrypting boolean circuits does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Homomorphic public-key cryptosystems and encrypting boolean circuits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Homomorphic public-key cryptosystems and encrypting boolean circuits will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-198871

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.