First watch the film-pilot "My Conquest is the Sea of Stars". Then watch "Overture to a New War", the theatrically-released remake of the first two episodes. Then continue with episode three.
Hierarchical model of masters and servants has been discredited long ago.
Nice switcheroo. Organizing people hierarchically is not a discredited notion. Having masters and servents is. In real life,we play pre-defined roles in larger groups and even dress differently depending on what our role is. That's how civilization functions. Your boss doesn't legally own you, and have full control over your person 24/7.
We can have creativity, expression, and mutal respect within hiearchies, and often with them we can rise or fall within organizing structure. This is Slashdot, aren't you familier with computer programming? Structures matter, hierarchies are as elemental to structures as hydrogen is to chemistry. If they weren't hippies would rule the world.
Now if you argue that an unvaccinated child puts your vaccinated child at risk, aren't you whining that you don't believe the vaccine conferred immunity to your child?
It's not about PopeRatzo's hypothetically vaccinated child. It's about anyone who had a legitimate medical reason to not be vaccinated whose only protection is through herd immunity. Maybe PopeRatzo confers his blessings onto other people's kids too.
Can anyone say "razor blades"?
Cryptology ePrint Archive: Report 2013/451
Candidate Indistinguishability Obfuscation and Functional Encryption for all circuits
Sanjam Garg and Craig Gentry and Shai Halevi and Mariana Raykova and Amit Sahai and Brent Waters
Abstract: In this work, we study indistinguishability obfuscation and functional encryption for general circuits:
Indistinguishability obfuscation requires that given any two equivalent circuits C_0 and C_1 of similar size, the obfuscations of C_0 and C_1 should be computationally indistinguishable.
In functional encryption, ciphertexts encrypt inputs x and keys are issued for circuits C. Using the key SK_C to decrypt a ciphertext CT_x = Enc(x), yields the value C(x) but does not reveal anything else about x. Furthermore, no collusion of secret key holders should be able to learn anything more than the union of what they can each learn individually.
We give constructions for indistinguishability obfuscation and functional encryption that supports all polynomial-size circuits. We accomplish this goal in three steps:
- We describe a candidate construction for indistinguishability obfuscation for NC1 circuits. The security of this construction is based on a new algebraic hardness assumption. The candidate and assumption use a simplified variant of multilinear maps, which we call Multilinear Jigsaw Puzzles.
- We show how to use indistinguishability obfuscation for NC1 together with Fully Homomorphic Encryption (with decryption in NC1) to achieve indistinguishability obfuscation for all circuits.
- Finally, we show how to use indistinguishability obfuscation for circuits, public-key encryption, and non-interactive zero knowledge to achieve functional encryption for all circuits. The functional encryption scheme we construct also enjoys succinct ciphertexts, which enables several other applications.
Category / Keywords: public-key cryptography / Obfuscation, Functional Encryption, Multilinear Maps
Date: received 20 Jul 2013, last revised 21 Jul 2013
Contact author: amitsahai at gmail com
Available format(s): PDF | BibTeX Citation
Without life, Biology itself would be impossible.