Q4638056 (Q4638056): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptography in $NC^0$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Garble Arithmetic Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally Computable UOWHF with Linear Shrinkage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress in Cryptology – Mycrypt 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Multivariate Hash Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random codes: minimum distances and error exponents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: QUAD: A multivariate stream cipher with provable security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smaller Decoding Exponents: Ball-Collision Decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Building Hash Functions from Multivariate Quadratic Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hunting of the SNARK / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rank of sparse random matrices over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noise-tolerant learning, the parity problem, and the statistical query model / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking the Circuit Size Barrier for Secure Computation Under DDH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the performance of belief propagation decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Satisfiability of Small Depth Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amplifying Collision Resistance: A Complexity-Theoretic Treatment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3792624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of statistically hiding bit commitment schemes and fail-stop signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivariates Polynomials for Hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance Verification for Classical and Quantum LDPC Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of approximating the minimum distance of a linear code / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security Bounds for the Design of Code-Based Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully homomorphic encryption using ideal lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based / rank
 
Normal rank
Property / cites work
 
Property / cites work: Candidate One-Way Functions Based on Expander Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collision-Free Hashing from Lattice Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Cryptographic Applications of Random Functions (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Hashing via List Recoverability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbalanced Oil and Vinegar Signature Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941844 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ensembles of low-density parity-check codes: asymptotic distance distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Compact Knapsacks Are Collision Resistant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally Sound Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4343439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Learning Requires Good Memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of computing the minimum distance of a code / rank
 
Normal rank

Latest revision as of 14:04, 15 July 2024

scientific article; zbMATH DE number 6866297
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 6866297

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    3 May 2018
    0 references
    cryptography
    0 references
    hash functions
    0 references
    complexity theory
    0 references
    coding theory
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers