Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs (Q5738884): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Lower Bounds in the Hardware Token Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Unified Security Model for Physically Unclonable Functions / 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: New Constructions for UC Secure Computation Using Tamper-Proof Hardware / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility and Infeasibility of Secure Computation with Malicious PUFs / 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: General Statistically Secure Computation with Bounded-Resettable Hardware Tokens / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing Resettable UC-Functionalities with Untrusted Tamper-Proof Hardware-Tokens / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Founding Cryptography on Tamper-Proof Hardware Tokens / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stateless Cryptographic Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Computation from Leaky Correlated Randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting Correlations / 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: Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens / 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: Topics in Cryptology – CT-RSA 2006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing locally computable extractors and cryptosystems in the bounded-storage model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious Transfer Is Symmetric / rank
 
Normal rank

Latest revision as of 22:43, 13 July 2024

scientific article; zbMATH DE number 6729672
Language Label Description Also known as
English
Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs
scientific article; zbMATH DE number 6729672

    Statements

    Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs (English)
    0 references
    0 references
    0 references
    0 references
    13 June 2017
    0 references

    Identifiers