Astonishingly, the private keys were 4, 56, 66, 115, 155, 156, 230, 237.

exploiting compromised certificates requires an active adversary-in-the-middle attack, meaning the attacker must act as a proxy between two TLS parties and receive encrypted traffic, decrypt it, reencrypt it, and send it to the other party. Such capabilities, in some cases, are usually limited to only the most well-resourced attackers. People with control of a local network—at a coffee shop, university, or other organization—face much less of a challenge.

https://emudhra.we-have-a-problem.com/

Xkcd 221: int getRandomNumber() { return 4; // chosen by fair dice roll. guaranteed to be random. }

  • hirihit640@sh.itjust.works
    link
    fedilink
    English
    arrow-up
    6
    arrow-down
    1
    ·
    13 hours ago

    DNS requires consensus (on who owns which name). So if by “voting peer system” you are talking about decentralized consensus, then blockchain is one of the only systems of such kind.

    If you don’t want blockchain, then there’s no real choice other than a centralized system like CAs.

    • non_burglar@lemmy.world
      link
      fedilink
      English
      arrow-up
      2
      ·
      8 hours ago

      Eh, blockchain wouldn’t work here because changes to the ledger on the scale of DNS would take an astronomical amount of time to propagate. Blockchain would solve “source of truth” issues, but waiting 30 seconds or more every to.e you open your browser or curl to update the list of changes to the CRL wouldn’t be an acceptable working solution.

      The problem of “voting peers” I mentioned would more easily be solved by a mechanism closer to how clusters decide which members are reliable and which should be deemed faulty. The problem is to instantly make changes to the CRL that are believable and take effect immediately.

      Blockchain can’t do that in a timely way.

      • hirihit640@sh.itjust.works
        link
        fedilink
        English
        arrow-up
        1
        ·
        8 hours ago

        how clusters decide which members are reliable and which should be deemed faulty.

        I believe you’re talking about RAFT. That requires trusting all nodes, so it’s not any different from how CAs already work. After all, the issue at hand is a compromised CA.

        • non_burglar@lemmy.world
          link
          fedilink
          English
          arrow-up
          1
          ·
          7 hours ago

          I believe you’re talking about RAFT. That requires trusting all nodes, so it’s not any different from how CAs already work.

          You lost me, none of that is true.

          After all, the issue at hand is a compromised CA.

          That’s not what happened at all. Read the article.

          • Aatube@lemmy.dbzer0.comOP
            link
            fedilink
            English
            arrow-up
            2
            ·
            4 hours ago

            if the keys are compromised, the CA is considered compromised until it is updated. from a black-box perspective this is not different from the CA’s keys being leaked.