Back to courses

    Conference Talks

    49,909 courses
    MiMC - Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
    TheIACR

    MiMC - Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity

    Balloon Hashing - A Memory Hard Function Providing Provable Protection Against Sequential Attacks
    TheIACR

    Balloon Hashing - A Memory Hard Function Providing Provable Protection Against Sequential Attacks

    Linear Structures - Applications to Cryptanalysis of Round Reduced Keccak
    TheIACR

    Linear Structures - Applications to Cryptanalysis of Round Reduced Keccak

    When Are Fuzzy Extractors Possible
    TheIACR

    When Are Fuzzy Extractors Possible

    The Reality of Cryptographic Deployments on the Internet
    TheIACR

    The Reality of Cryptographic Deployments on the Internet

    Faster Fully Homomorphic Encryption - Bootstrapping in Less Than 0.1 Seconds
    TheIACR

    Faster Fully Homomorphic Encryption - Bootstrapping in Less Than 0.1 Seconds

    A General Polynomial Selection Method and New Asymptotic Complexities
    TheIACR

    A General Polynomial Selection Method and New Asymptotic Complexities

    On the Security of Supersingular Isogeny Cryptosystems
    TheIACR

    On the Security of Supersingular Isogeny Cryptosystems

    Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption
    TheIACR

    Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption

    From 5 Pass MQ Based Identification to MQ Based Signatures
    TheIACR

    From 5 Pass MQ Based Identification to MQ Based Signatures

    Collapse Binding Quantum Commitments Without Random Oracles
    TheIACR

    Collapse Binding Quantum Commitments Without Random Oracles

    Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
    TheIACR

    Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings

    Selective Opening Security in the Presence of Randomness Failures
    TheIACR

    Selective Opening Security in the Presence of Randomness Failures

    Zero Knowledge Accumulators and Set Algebra
    TheIACR

    Zero Knowledge Accumulators and Set Algebra

    Efficient KDM CCA Secure Public Key Encryption for Polynomial Functions
    TheIACR

    Efficient KDM CCA Secure Public Key Encryption for Polynomial Functions

    Selective Opening Security from Simulatable Data Encapsulation
    TheIACR

    Selective Opening Security from Simulatable Data Encapsulation

    Structure Preserving Smooth Projective Hashing
    TheIACR

    Structure Preserving Smooth Projective Hashing

    From 5 Pass MQ Based Identification to MQ Based Signatures
    TheIACR

    From 5 Pass MQ Based Identification to MQ Based Signatures

    Living Between the Ideal and Real Worlds
    TheIACR

    Living Between the Ideal and Real Worlds

    Non Interactive Secure 2PC in the Offline - Online and Batch Settings
    TheIACR

    Non Interactive Secure 2PC in the Offline - Online and Batch Settings

    Computational Integrity with a Public Random String from Quasi Linear PCPs
    TheIACR

    Computational Integrity with a Public Random String from Quasi Linear PCPs