Feasibility and infeasibility of secure computation with malicious PUFs (Q2175217): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00145-019-09329-9 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00145-019-09329-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2958290638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Physically Uncloneable Functions in the Universal Composition Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally Composable Security with Global Setup / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the limitations of universally composable two-party computation without set-up assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconditionally Secure and Universally Composable Commitments from Physical Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Founding Cryptography on Oblivious Transfer – Efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally Composable Multi-party Computation Using Tamper-Proof Hardware / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of security of Yao's protocol for two-party computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Security Analysis of PUF-Based Two-Player Protocols / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00145-019-09329-9 / rank
 
Normal rank

Latest revision as of 08:56, 17 December 2024

scientific article
Language Label Description Also known as
English
Feasibility and infeasibility of secure computation with malicious PUFs
scientific article

    Statements

    Feasibility and infeasibility of secure computation with malicious PUFs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 April 2020
    0 references
    secure computation
    0 references
    oblivious transfer
    0 references
    physically unclonable functions
    0 references

    Identifiers