8 projects tagged "Apache 2.0"
OpenXPKI is a Web and CLI-based enterprise-grade PKI/trust center system (X509 public key infrastructure) complete with CA, Web interfaces, offline support, and support for well established infrastructure components like RDBMS and Hardware Security Modules. Flexibility and modularity are the project's key design objectives. Unlike many other PKI solutions, it offers powerful features necessary for professional environments. However, small scale installations are also targeted by providing quick-start configuration examples that allow you to get a usable PKI running quickly.
The Secure Storage service for the gLite middleware provides users with a set of tools for storing data securely and in an encrypted format on the grid storage elements. Data is accessible and readable by authorized users only. Moreover, it solves the insider abuse problem by also preventing administrators of the storage elements from accessing the confidential data in a clear format. The service has been designed and developed for the grid middleware of the EGEE Project, gLite, in the context of the TriGrid VL Project.
libapache2-mod-scramble-ip is an Apache 2 module that works like mod_removeip, but instead of just overwriting the IP address with 127.0.0.1, it encrypts the IP address. This way you always get an IP address to work with (in scripts, etc.) and have the ability to use tools like awstats to analyze your logs. It's in alpha status, but working on some Apache 2 servers, and the 'cost' (load) should be small and reasonable.
LibRCrypt is an Objective C library for complex data encryption based on Rubik's Cubes. The idea's pretty simple: If you represent data as the squares on a Rubik's Cube, you can apply transformations to the data and get back encrypted data, all of which is commutatitive. Just as a Rubik's Cube can be solved if you know all of the moves, this data can be "unwound", so to speak, if you know all of the transforms applied, but the encryption is even deeper than that. A cube can only cover (9 squares per face x 6 faces) 54 significant bits of data. Therefore, compressed data must be composed of multiple (even thousands) of Rubik's Cubes.