Secure Multi-Party Computation is a set of methods that allow multiple parties to jointly compute a result using their private data, without revealing their individual inputs to each other. The goal is to ensure that no one learns more than what can be inferred from the final output. These techniques are used to protect sensitive…
Category: Cryptographic Primitives
Verifiable Computation
Verifiable computation is a method that allows someone to ask a third party to perform a calculation, then check that the result is correct without having to redo the entire work themselves. This is especially useful when the person verifying does not have the resources or time to carry out the computation independently. The process…
Proof of History
Proof of History is a cryptographic method used to create a historical record that proves an event has occurred at a specific time. It works by producing a series of hashes, each building on the previous one, making it easy to verify the sequence and timing of events. This approach allows computers in a network…
Proof of Space
Proof of Space is a method for proving that a participant has allocated a certain amount of storage space to a task or process. It is used as an alternative to proof of work in some blockchain and distributed systems, where instead of requiring computational power, participants show they have set aside disk space. This…
Blockchain and Cryptography
Blockchain is a digital system for recording transactions in a way that makes them secure, transparent, and nearly impossible to alter. Each block contains a list of transactions, and these blocks are linked together in a chain, forming a permanent record. Cryptography is the use of mathematical techniques to protect information, making sure only authorised…
Post-Quantum Cryptography
Post-Quantum Cryptography is a field of cryptography focused on developing encryption methods that can withstand attacks from quantum computers. Quantum computers are expected to be able to break many current cryptographic systems, making it essential to create new algorithms that remain secure. These new methods are designed to be implemented using existing computers and networks,…
Quantum-Resistant Cryptography
Quantum-resistant cryptography refers to methods of securing digital data so that it remains safe even if quantum computers become powerful enough to break current encryption. Traditional cryptographic systems, like RSA and ECC, could be easily broken by quantum computers using specialised algorithms. Quantum-resistant algorithms are designed to withstand these new threats, keeping data secure for…
Transport Layer Security (TLS) Optimisation
Transport Layer Security (TLS) optimisation refers to the process of improving the speed and efficiency of secure connections over the internet while maintaining strong security. It involves techniques such as reducing handshake times, reusing session data, and choosing faster cryptographic algorithms. The goal is to make encrypted communications as fast and seamless as possible for…
Cryptographic Key Rotation
Cryptographic key rotation is the process of replacing old encryption keys with new ones on a regular basis or when a key is suspected of being compromised. This practice helps protect sensitive data by reducing the risk of unauthorised access if a key is exposed. It also ensures that even if a key is discovered,…
Verifiable Random Functions
A verifiable random function, or VRF, is a type of cryptographic tool that produces random outputs which can be independently checked for correctness. When someone uses a VRF, they generate a random value along with a proof that the value was correctly created. Anyone can use this proof to verify the result without needing to…