On Constructing Homomorphic Encryption Schemes from Coding Theory (Q3104683): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On Constructing Homomorphic Encryption Schemes from Coding Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Receipt-free secret-ballot elections (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Black-Box Fields and their Application to Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphic Signatures for Polynomial Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular-Secure Encryption from Decision Diffie-Hellman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3149671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Authority Secret-Ballot Elections with Linear Work / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Arithmetic Codex: Theory and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2724587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4314356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A public key cryptosystem and a signature scheme based on discrete logarithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully homomorphic encryption using ideal lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing Gentry’s Fully-Homomorphic Encryption Scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public-Key Cryptosystems Resilient to Key Leakage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additively Homomorphic Encryption with d-Operand Multiplications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious Polynomial Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphic Encryption with CCA Security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Securing Computation against Continuous Leakage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Fully Homomorphic Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detection and recognition of a binary linear code / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Homomorphic Encryption over the Integers / rank
 
Normal rank

Latest revision as of 17:38, 4 July 2024

scientific article
Language Label Description Also known as
English
On Constructing Homomorphic Encryption Schemes from Coding Theory
scientific article

    Statements

    On Constructing Homomorphic Encryption Schemes from Coding Theory (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 December 2011
    0 references
    homomorphic encryption
    0 references
    coding theory
    0 references
    efficiency
    0 references
    provable security
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers