MyOPE: malicious security for oblivious polynomial evaluation (Q6134853): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-031-14791-3_29 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3202874560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the concrete hardness of learning with errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A full RNS variant of FV like somewhat homomorphic encryption schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Non-interactive Arguments via Linear Interactive Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flexible and efficient verifiable computation on encrypted data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive proof composition from accumulation schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs for inner pairing products and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearly Homomorphic Encryption from $$\mathsf {DDH}$$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updateable Inner Product Argument with Logarithmic Verifier and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boosting verifiable computation on encrypted data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic Span Programs and Succinct NIZKs without PCPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully homomorphic encryption using ideal lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs / rank
 
Normal rank
Property / cites work
 
Property / cites work: MyOPE: malicious security for oblivious polynomial evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Key Sizes (and Attacks) for LWE-Based Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious transfer and 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: PSI from PaXoS: fast, malicious private set intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented Oblivious Polynomial Evaluation Protocol and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851616 / rank
 
Normal rank

Latest revision as of 10:10, 2 August 2024

scientific article; zbMATH DE number 7716971
Language Label Description Also known as
English
MyOPE: malicious security for oblivious polynomial evaluation
scientific article; zbMATH DE number 7716971

    Statements

    MyOPE: malicious security for oblivious polynomial evaluation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 July 2023
    0 references
    poly-logarithmic communication complexity
    0 references
    malicious senders
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers