search for: deanonymization

HD Moore from MetaSploit has noted that, given a pubkey (and not the corresponding private key, as might be found in authorized_keys), he can determine if he'd be able to log into an account. It's a small thing, but he's using it for very interesting recon/deanonymization. He'll be releasing a paper shortly, not overplaying the characteristic, but certainly showing it can be used to do cute things. I expect this is easily fixable -- simply provide the challenge for a pubkey whether or not it'd actually be able to log in successfully. But it's worth ex...

On 2016-03-10 15:43, Cole Robinson wrote: > On 03/10/2016 02:29 AM, Martin Kletzander wrote: >> On Fri, Mar 04, 2016 at 04:23:18PM +0000, bancfc@openmailbox.org >> wrote: >>> The single most important usability feature missed by our less >>> technical >>> users who migrate from VirtualBox is a one click import/export of >>> VMs >>>

On Fri, Mar 11, 2016 at 10:32:15PM +0000, bancfc@openmailbox.org wrote: >On 2016-03-10 15:43, Cole Robinson wrote: >> On 03/10/2016 02:29 AM, Martin Kletzander wrote: >>> On Fri, Mar 04, 2016 at 04:23:18PM +0000, bancfc@openmailbox.org >>> wrote: >>>> The single most important usability feature missed by our less >>>> technical >>>>

On Wed, 6 Sep 2023, procmem at riseup.net wrote: > Hi, Whonix OS privacy dev here. I had a discussion concerning the new > ObscureKeystrokeTiming feature with a prominent researcher and author of the > mouse and keyboard biometrics obfuscation tool called Kloak. While it's > exciting to see keystroke obfuscation measures [1] start to become more > prevalent mainstream, the

On Fri, Mar 04, 2016 at 04:23:18PM +0000, bancfc@openmailbox.org wrote: >The single most important usability feature missed by our less technical >users who migrate from VirtualBox is a one click import/export of VMs >and their config settings. > >I was optimistic about the Gnome Boxes effort on Govf lib but >unfortunately it was never realized and I would hesitate to recommend

...degree of vertex has upper bound" since "Graph isomorphism where degree of vertex has upper bound" has tractable solution. This approach seems promising. > > > > I also came across solving Graph matching using Simulated Annealing (http://randomwalker.info/luther/kaggle-deanonymization/Graph_Matching_via_Simulate.html) which also seems promising. > > > > How do you feel about these? > > > > > >> > In the lpSolve document there does not seem to be any option where one can specify which variable should the optimizer use to use LP relaxation...