Search Results for "distributed shared memory"

DSVPN is a Dead Simple VPN, designed to address the most common use case for using a VPN. Runs on TCP. Works pretty much everywhere, including on public WiFi where only TCP/443 is open or reliable. Uses only modern cryptography, with formally verified implementations. Small and constant memory footprint. Doesn't perform any heap memory allocations. Small (~25 KB), with an equally small and readable code base. No external dependencies. Works out of the box. No lousy documentation to read. No...

wholeaked is an open source file distribution and tracking tool designed to help identify the source of leaked files. It works by generating unique versions of a file for each recipient and embedding identifying signatures or metadata into each distributed copy. If the file later appears in an unauthorized location, the embedded identifier can be analyzed to determine which recipient originally received that specific version. This approach allows organizations, researchers, or individuals to trace the origin of leaks in sensitive documents, binaries, or other shared resources. wholeaked automates the process of creating personalized file variants and associating them with a list of recipients. ...

The Safe C Library provides bound checking memory and string functions per ISO/IEC TR24731. These functions are alternative functions to the existing standard C library that promote safer, more secure programming. The ISO/IEC Programming languages — C spec, C11, now includes the bounded APIs in Appendix K, "Bounds-checking interfaces". This latest upload supports building static library, a shared library and a linux kernel module.

ANts P2P realizes a third generation P2P net. It protects your privacy while you are connected and makes you not trackable, hiding your identity (ip) and crypting everything you are sending/receiving from others.

Compute shared RSA keys for two parties using Gilboa's protocol. Other protocols may be added. Contains JAVA source for Benaloh, Naccache-Stern and Goldwasser-Michali crypto-algorithms. Oblivious transfers and BiPrimaliy tests also implemented.