On Wednesday, 26 July 2023, at 12 PM ET/9 AM PT/6 PM CEST Team ZeroTier will host a webinar for our user community featuring our Founder & CEO, @adamierymenko.
During this one-hour session, Adam will discuss the ZeroTier mission, networking industry meta trends, and the exciting things on tap for ZeroTier.
Just a quick note about why quantum computing primarily attacks asymmetric algorithms and not symmetric ones.
Asymmetric keys are generally built on trapdoor functions—functions that are trivial to calculate, but difficult to reverse. Such as multiplication and division.
Asymmetric keys have structure in the group that symmetric keys don't have, and it's quantum computing algorithms that exploit this.
@skiff open sourced their cryptographic library "including useful functions for symmetric encryption, asymmetric encryption, hashing, and more. Contributions and suggestions are welcome!"
I’ve been making a lot of not-getting-cryptography jokes here lately but honestly the way my advisor explained a simplest secret sharing representation blew my mind. Why did I not know this before??
Your secret function is a line y=mx+c and your secret is value of y at x=0. Each party has one point from the line. Individually, with just one point there can be numerous lines passing through that point but only when they come together, they can compute the secret.
this is a fantastic result but also... quite worrying
"This paper presents a practical implementation of a state-of-the-art deep learning model in order to classify laptop keystrokes, using a smartphone integrated microphone. When trained on keystrokes recorded by a nearby phone, the classifier achieved an accuracy of 95%, the highest accuracy seen without the use of a language model. When trained on keystrokes recorded using the video-conferencing software Zoom, an accuracy of 93% was achieved"
Even though the first and last bytes are not properly clamped above, when generating the public key, the wg(8) tool will clamp it. Further, when bringing up the interface, Wireguard will also clamp it.
Hello Everyone! I'm Sarah. Executive Director of Open Privacy (https://openprivacy.ca/) - a Canadian non-profit society dedicated to researching & building privacy enhancing tools (like https://cwtch.im) that empower people.
I spend most of my days conducting #cryptography and #privacy research, and a fair amount of time disclosing security issues in a variety of systems.
Cannon has a proprietary way of signing photos to make it proof that the file has not been tampered after taking photo. I am wondering if there is an #OpenSource way to do this on like an android phone. Take a photo and have it be cryptographically guaranteed against phone hardware that it has not been tampered with after taking the photo. #cryptography#photography#signatures#foss#android#legal#legaltech
Heute ging es an der TH Köln um das chinesische Spionage- und Cyberrecht - bei vollem Haus mit 170 angemeldeten Teilnehmer:innen! Wer nicht dabei sein konnte: Der Vortrag wurde aufgezeichnet, in Kürze gibt es hier den Link. #china#cyberlaw#cybersecurity#cryptography
@Perl Good news, the #Perl module IO::Socket::SSL now defaults to using the #TLS cryptographic protocol version 1.2 or greater. (Earlier versions have been widely deprecated for a couple of years due to weaknesses found in the #MD5 and #SHA1 hashing functions.)
Note that if you’ve updated #OpenSSL recently you may also have to rebuild and reinstall Net::SSLeay from #CPAN.
Let's say I have 1000 friends (haha, I know, right?) and I want to send each of them a number. If I put all the numbers into a list and send the list to all my friends, that sort of works, but each friend won't know which number is theirs.
So I'd like some way to tag each number in the list so each friend can quickly tell which number is theirs, but no one else can. ie, something faster than linear time search through the list would be ideal, but I'd settle for something linear if the constants are small. Maybe something like string equality as the match operation, but not a decryption.
And if someone who isn't my friend sees the list with all the tagged numbers, they shouldn't be able to tell who any of my friends are by using the tags somehow.
Me and all my 1000 friends (lol, it's still funny) all have asymmetric keypairs, so we can use those.
Is this a well-studied problem that has a name I don't know about yet? Maybe there are special-purpose tools that are a good fit for this?
Or maybe there's some clever scheme using encryption that solves this? I feel like a deterministic encryption of some well-known message for each friend gets pretty close. Then add a list-level nonce to make it randomized for each list, but not each friend. Then a friend can do the deterministic encryption using the nonce and scan through the list pretty quickly to find their number. But my asymmetric encryption primitive is randomized, so I can't quite make it work that way unless I use a different primitive.
Although, if the message to be encrypted deterministically is well-known, and the goal is not actually to protect the message, that kind of suggests encryption is the wrong tool here. I'm looking for some kind of tag that is only recognizable by the holder of the private key.
Question for crypto (as in cryptographic) nerds, I am looking for an automated solution for on-prem backups that encrypts said backup. The plan is to take said encrypted backup and store it off sight. Prefer open source, and for further context consider this "home lab" although it does involve multiple servers with public IPs etc. I do not want to have the encryption key easily reachable like in plaintext in a config file.
Right now this is all happening manually, but automated would make this so much easier. It does not have to be a full end-to-end solution, even just the encrypting part being able to be automated would be fine as I could simply script around it. Thoughts and recommendations?
Cryptography may offer a solution to the massive AI-labeling problem (www.technologyreview.com)
An internet protocol called C2PA adds a “nutrition label” to images, video, and audio.