Simplifying Design and Analysis of Complex Predicate Encryption Schemes
Explore advanced techniques for designing and analyzing complex predicate encryption schemes, focusing on simplification methods to enhance cryptographic security.
On Removing Graded Encodings from Functional Encryption
Explore advanced cryptography concepts, focusing on removing graded encodings from functional encryption. Learn about succinct ciphertexts, indistinguishability obfuscation, and decomposable XIO.
Unconditional UC Secure Computation with Stronger Malicious PUFs
Explore unconditional UC secure computation using stronger malicious PUFs, as presented at Eurocrypt 2017. Learn about advancements in cryptographic protocols and their implications.
Sublinear Zero Knowledge Arguments for RAM Programs
Explore cutting-edge cryptographic techniques for efficient zero-knowledge proofs in RAM programs, enhancing privacy and security in computational systems.
Short Generators Without Quantum Computers - The Case of Multiquadratics
Explore multiquadratic cryptography as an alternative to quantum-resistant systems, examining its potential for generating secure short keys efficiently.
Formal Abstractions for Attested Execution Secure Processors
Explore formal abstractions for attested execution in secure processors, covering standard models, concrete examples, simulation, fairness, and implications for cryptographic protocols.
One Shot Verifiable Encryption from Lattices
Explore lattice-based cryptography with a focus on one-shot verifiable encryption, covering zero-knowledge proofs, Ring-LWE encryption, and practical applications in this cutting-edge research presentation.
How Fast Can Higher Order Masking Be in Software
Explore efficient higher-order masking techniques in software implementations for enhanced cryptographic security against side-channel attacks.
A Kilobit Hidden SNFS Discrete Logarithm Computation
Explore the computation of discrete logarithms using SNFS, discussing its implications for cryptography and digital signatures, with a focus on prime selection and security considerations.
Private Puncturable PRFs From Standard Lattice Assumptions
Explore private puncturable PRFs based on lattice assumptions, covering pseudorandom functions, distributed point functions, and learning with errors, with insights on matrix circuit encoding.
Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption
Explore transforming combiners in cryptography, focusing on indistinguishability obfuscation and functional encryption. Learn about robust iO combiners and their implications for secure systems.
Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model
Explore parallel implementations of masking schemes and the bounded moment leakage model in cryptography, examining their implications for secure system design.
From Minicrypt to Obfustopia via Private Key Functional Encryption
Explore the cryptographic journey from Minicrypt to Obfustopia, delving into private key functional encryption and its implications for advanced security systems.
Constraint Hiding Constrained PRFs for NC1 from LWE
Explore constraint hiding constrained PRFs for NC1 from LWE, covering syntax, obfuscation, functional encryption, and the Barrington Theorem.
Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation From Degree
Explore advanced cryptographic constructions including projective arithmetic functional encryption and indistinguishability obfuscation, with insights on efficiency and future research directions.
Improved Private Set Intersection against Malicious Adversaries
Explore advanced techniques for secure private set intersection, focusing on enhanced protection against malicious adversaries in cryptographic protocols.
ZMAC - A Fast Tweakable Block Cipher Mode for Highly Secure Message Authentication
Explore ZMAC, a fast tweakable block cipher mode for secure message authentication. Learn its structure, security bounds, and efficiency compared to other modes.
Watermarking Cryptographic Functionalities from Standard Lattice Assumptions
Explore lattice-based cryptography for watermarking pseudorandom functions, focusing on implementation, private punctured OPRS, and homomorphic matrix encoding techniques.
Topology Hiding Computation on All Graphs
Explore topology hiding computation on all graphs, covering security, broadcast results, protocols, and semantic security. Discover contributions and open questions in this cryptographic field.
Verified Drop in Replacements for TLS & HTTPS
Explore secure alternatives to TLS and HTTPS protocols with expert Cedric Fournet, focusing on verified drop-in replacements for enhanced cybersecurity.
Time Memory Tradeoff Attacks on the MTP Proof of Work Scheme
Explore time-memory tradeoff attacks on MTP proof of work, covering memory-hard functions, Merkle hash trees, and computational complexity in blockchain security.