67 entries in 0.374s
mircea_popescu: but yes, the relation you unearth is sound. the problem or set thereof i started discussing is exactly
homomorphic to "well, we have no proper rng tests, "ou'll have to take the girl by the nose, count, and break out the abacuses.")
a111: Logged on 2017-09-15 23:48 asciilifeform: kanzure: i spilled the beans from a similar darpa conference that i attended, in the heart of the beast itself, few yrs back ( it's in the l0gz, spoiler : multilinear map
homomorphic crypto is bunkum ) and still waiting for gasenwagen
ben_vulpes: "the guys down the office keep giving us hardons with the
homomorphic encryption stuff but every time we sit down to discuss numbers it turns out to be computationally infeasible so uh here's this rest layer over postgres so you don't have to touch the dirty dirty phone numbers yourselves"
mircea_popescu: you may be challenged to either show the hamiltonian in the
homomorphic graph, or else to show the homomorphism between the graphs.
mircea_popescu: anyway. the encryption scheme is like this : you generate a large graph with a hamiltonian cycle ; and a
homomorphic graph.
mircea_popescu: well, deciding whether two given graphs are
homomorphic is > np.
mircea_popescu: and ALSO exactly
homomorphic to why i said division doesn't belong in there.
adlai: mircea_popescu: a comment - you mention
homomorphic encryption with out qualifying part- or fully. the former exists! the latter...
mircea_popescu: now hush about all this and go make me actual
homomorphic encryption so i can compute platform-independent.
assbot: Logged on 05-02-2014 03:56:24; asciilifeform: i venture to say that the actual goal of general-purpose (or whatever approximation is possible)
homomorphic crypto is quite different.
adlai notes that "full program obfuscation", like "fully
homomorphic encryption", Exists less than even Bitcoin
assbot: Logged on 05-02-2014 03:50:12; asciilifeform: there is already a hard impossibility proof of turing-complete computation in a
homomorphic turd.
assbot: Logged on 14-11-2015 01:02:07; mircea_popescu: what the fuck is "fully
homomorphic encryption" supposed to be.
mircea_popescu: what the fuck is "fully
homomorphic encryption" supposed to be.
☟︎ ascii_field: anyway this would be more interesting if '
homomorphic crypto' weren't a sc4m
ascii_field: the (largely lysenkoine and fraudulent, but bear with me) promise of '
homomorphic' is that you can, ostensibly, make a circuit where determining function is similar to breaking rsa
ascii_field: mircea_popescu: the '
homomorphic' shit is strictly for 'secure against owner'
assbot: Logged on 05-02-2014 03:56:24; asciilifeform: i venture to say that the actual goal of general-purpose (or whatever approximation is possible)
homomorphic crypto is quite different.
mats:
homomorphic properties of some crypto-system perhaps
Vexual: perhaps something like this will be brave enough to invent perpect
homomorphic encryption
assbot: Logged on 05-02-2014 03:56:24; asciilifeform: i venture to say that the actual goal of general-purpose (or whatever approximation is possible)
homomorphic crypto is quite different.
benkay: "semi
homomorphic encryption and multiparty communication" is what the web tells me this snake oil is called.
benkay: ;;later tell mircea_popescu "
homomorphic or semi-
homomorphic" encryption, where 3 parties each control one computer working with the other two in lockstep to solve the problem.
cads: right, I guess to jump from
homomorphic encryption to obfuscated computation is a natural one.
mircea_popescu: so inasfar as that, it may be the case
homomorphic software can be in fact written that protects the key say
mircea_popescu: as the future eventualyl turns into past, what bitbet has to do and what the courts have to do are
homomorphic : establish what the words say, what the facts are and how the two relate.