Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model (Q5738764): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-662-54388-7_15 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2583877491 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive versus non-adaptive security of multi-party protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally Composable Security with Global Setup / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation / 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: New Constructions for UC Secure Computation Using Tamper-Proof Hardware / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple, Black-Box Constructions of Adaptively Secure Protocols / 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: Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds / 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: Q4536817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public Key Cryptography - PKC 2005 / 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: 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: Concurrently Secure Computation in Constant Rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptively Secure Multi-Party Computation with Dishonest Majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Software protection and simulation on oblivious RAMs / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Time Programs / 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: Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity / 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: Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions / 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: A unified framework for concurrent security / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries / 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: Adaptive zero-knowledge proofs and adaptively secure oblivious transfer / 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
Property / cites work
 
Property / cites work: On Adaptively Secure Protocols / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:40, 13 July 2024

scientific article; zbMATH DE number 6729537
Language Label Description Also known as
English
Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model
scientific article; zbMATH DE number 6729537

    Statements

    Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model (English)
    0 references
    13 June 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references