Back to courses

    Conference Talks

    49,909 courses
    The Minimum Number of Cards in Practical Card-Based Protocols
    TheIACR

    The Minimum Number of Cards in Practical Card-Based Protocols

    Succinct Spooky Compilers Are Not Black Box Sound
    TheIACR

    Succinct Spooky Compilers Are Not Black Box Sound

    Two Round PAKE from Approximate SPH and Instantiations from Lattices
    TheIACR

    Two Round PAKE from Approximate SPH and Instantiations from Lattices

    Blockcipher Based MACs Beyond the Birthday Bound Without Message Length
    TheIACR

    Blockcipher Based MACs Beyond the Birthday Bound Without Message Length

    Tightly Secure Signatures From Five Move Identification Protocols
    TheIACR

    Tightly Secure Signatures From Five Move Identification Protocols

    Cycle Slicer - An Algorithm for Building Permutations on Special Domains
    TheIACR

    Cycle Slicer - An Algorithm for Building Permutations on Special Domains

    K-Round Multiparty Computation from K-Round Oblivious Transfer via Garbled Interactive Circuits
    TheIACR

    K-Round Multiparty Computation from K-Round Oblivious Transfer via Garbled Interactive Circuits

    Two-Round Multiparty Secure Computation from Minimal Assumptions
    TheIACR

    Two-Round Multiparty Secure Computation from Minimal Assumptions

    Simple Proofs of Sequential Work
    TheIACR

    Simple Proofs of Sequential Work

    The Discrete-Logarithm Problem with Preprocessing
    TheIACR

    The Discrete-Logarithm Problem with Preprocessing

    Masking Proofs Are Tight and How to Exploit it in Security Evaluations
    TheIACR

    Masking Proofs Are Tight and How to Exploit it in Security Evaluations

    Masking the GLP Lattice-Based Signature Scheme at Any Order
    TheIACR

    Masking the GLP Lattice-Based Signature Scheme at Any Order

    Formal Verification of Masked Hardware Implementations in the Presence of Glitches
    TheIACR

    Formal Verification of Masked Hardware Implementations in the Presence of Glitches

    Non-malleable Codes from Average-Case Hardness
    TheIACR

    Non-malleable Codes from Average-Case Hardness

    Non-malleable Randomness Encoders and Their Applications
    TheIACR

    Non-malleable Randomness Encoders and Their Applications

    OPAQUE - An Asymmetric PAKE Protocol Secure Against Pre-computation Attacks
    TheIACR

    OPAQUE - An Asymmetric PAKE Protocol Secure Against Pre-computation Attacks

    Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange
    TheIACR

    Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange

    Fuzzy Password-Authenticated Key Exchange
    TheIACR

    Fuzzy Password-Authenticated Key Exchange

    Supersingular Isogeny Graphs and Endomorphism Rings - Reductions and Solutions
    TheIACR

    Supersingular Isogeny Graphs and Endomorphism Rings - Reductions and Solutions

    Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs
    TheIACR

    Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs

    Efficient Designated-Verifier Non-interactive Zero-Knowledge Proofs of Knowledge
    TheIACR

    Efficient Designated-Verifier Non-interactive Zero-Knowledge Proofs of Knowledge