Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity (Q3179364): 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-662-53641-4_15 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2535311203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035733 / 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: Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions / 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: New Constructions for UC Secure Computation Using Tamper-Proof Hardware / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent Non-Malleable Commitments (and More) in 3 Rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved OR-Composition of Sigma-Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online/Offline OR Composition of Sigma Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Stateful Hardware to Resettable Hardware Using Symmetric Assumptions / 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: Two-Round Secure MPC from Indistinguishability Obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Exact Round Complexity of Secure Computation / 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: Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Black-Box Complexity of Universally Composable Security in the CRS Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Secure Two-Party Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptively Secure Garbled Circuits from One-Way Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-Knowledge Proofs from Secure Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Founding Cryptography on Oblivious Transfer – Efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent composition of secure protocols in the timing model / 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: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Publicly Verifiable Non-Interactive Zero-Knowledge Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified framework for concurrent security / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Framework for UC from Only OT / rank
 
Normal rank
Property / cites work
 
Property / cites work: David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit commitment using pseudorandomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round-Optimal Black-Box Two-Party Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-Box Constructions of Two-Party Protocols from One-Way Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: New notions of security / rank
 
Normal rank

Latest revision as of 04:24, 13 July 2024

scientific article
Language Label Description Also known as
English
Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
scientific article

    Statements

    Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity (English)
    0 references
    21 December 2016
    0 references
    secure computation
    0 references
    tamper-proof hardware
    0 references
    round complexity
    0 references
    minimal assumptions
    0 references
    0 references
    0 references
    0 references

    Identifiers