Two-round oblivious transfer from CDH or LPN (Q2119032): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
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-030-45724-2_26 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2965686579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-message statistically sender-private OT from LWE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-message witness indistinguishability and secure computation in the plain model from new assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical hardness of learning with errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anonymous IBE, leakage resilience and circular security from new assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally composable two-party and multi-party secure computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-round multiparty secure computation from minimal assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth projective hashing and two-message oblivious transfer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguisher-dependent simulation in two rounds and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Simulate It – A Tutorial on the Simulation Proof Technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: New constructions of reusable designated-verifier NIZKs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5751927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Framework for Efficient and Composable Oblivious Transfer / rank
 
Normal rank

Latest revision as of 11:17, 28 July 2024

scientific article
Language Label Description Also known as
English
Two-round oblivious transfer from CDH or LPN
scientific article

    Statements

    Two-round oblivious transfer from CDH or LPN (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 March 2022
    0 references
    maliciously-secure two-round oblivious transfer
    0 references
    computational Diffie-Hellman assumption
    0 references

    Identifiers