Asymptotically Compact Adaptively Secure Lattice IBEs and Verifiable Random Functions via Generalize
Explore advanced cryptographic constructions: adaptively secure lattice-based identity-based encryption and verifiable random functions, focusing on asymptotic compactness and generalization techniques.
A New Approach to Round Optimal Secure Multiparty Computation
Explore a novel approach to round-optimal secure multiparty computation, covering methodology, strategy, and robust non-interactive proof commitments.
A Formal Treatment of Multi-Key Channels
Formal treatment of multi-key channels, exploring secure communication with multiple keys. Covers forward security, phase cancellation, and game-based notions, presenting a generic construction.
Improved Conditional Cube Attacks on Keccak Keyed Modes with MILP Method
Explores advanced cryptanalysis techniques for Keccak-based algorithms using conditional cube attacks and MILP, enhancing understanding of cryptographic vulnerabilities.
Efficient Ring Signatures in the Standard Model
Explore efficient ring signatures in the standard model, enhancing privacy and security in cryptographic protocols without relying on random oracles.
Kummer for Genus One over Prime Order Fields
Explore Kummer for genus one over prime order fields, covering hybrid elliptical receiver problem, conservative setup, implementation results, and comparisons in cryptography.
Quantum Fully Homomorphic Encryption with Verification
Explore quantum fully homomorphic encryption with verification, a cutting-edge cryptographic technique presented at Asiacrypt 2017, offering insights into secure quantum computation.
Access Control Encryption for General Policies from Standard Assumptions
Explore advanced encryption techniques for access control policies, focusing on standard assumptions and innovative constructions like divide-and-conquer and credit encryption.
Sharper Bounds in Lattice-Based Cryptography Using the Rényi Divergence
Explore improved security bounds for lattice-based cryptography using Rényi divergence, enhancing the analysis of cryptographic schemes and their resistance to attacks.
Collisions and Semi Free Start Collisions for Round Reduced RIPEMD 160
Explore cryptographic vulnerabilities in RIPEMD-160 hash function, examining collision attacks and semi-free-start collisions for reduced-round variants.
Automatic Search of Bit Based Division Property for ARX Ciphers and Word Based Division Property
Explore advanced cryptanalysis techniques for ARX ciphers, focusing on automatic search methods for bit-based and word-based division properties to enhance cipher security.
Towards a Classification of Non-Interactive Computational Assumptions in Cyclic Groups
Explore non-interactive computational assumptions in cyclic groups, covering families, variants, and hierarchies. Gain insights into cryptographic foundations and their classifications.
Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead
Explore advanced cryptographic techniques for secure oblivious linear function evaluation, focusing on malicious security and constant overhead improvements.
An Efficient Pairing Based Shuffle Argument
Explore efficient pairing-based shuffle arguments for e-voting, covering non-interactive arguments, security models, and implementation in bilinear groups.
Strengthening Access Control Encryption
Explore advanced encryption techniques for enhanced access control, focusing on security, use cases, and technical implementations.
New Key Recovery Attacks on Minimal Two Round Even Mansour Ciphers
Explores novel key recovery techniques for minimal two-round Even-Mansour ciphers, advancing cryptanalysis methods and enhancing understanding of cipher vulnerabilities.
Adaptive Oblivious Transfer with Access Control from Lattice Assumptions
Explore lattice-based cryptography through an adaptive oblivious transfer protocol with access control, enhancing privacy and security in data exchange systems.
Post Quantum Security of Fiat Shamir
Explore post-quantum security implications for the Fiat-Shamir transformation, a crucial cryptographic technique, in light of potential quantum computing threats.
Faster Packed Homomorphic Operations and Efficient Circuit Bootstrapping for TFHE
Explore advancements in homomorphic encryption with faster packed operations and efficient circuit bootstrapping for TFHE, enhancing privacy-preserving computations.
On the Depth of Oblivious Parallel RAM
Explore the intricacies of Oblivious Parallel RAM depth in this cryptography research presentation, delving into theoretical foundations and potential applications.
Coded BKW with Sieving
Explore an innovative approach to solving the Learning with Errors problem using coded BKW with sieving, presented at Asiacrypt 2017.