Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions (Q3179365): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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/978-3-662-53641-4_16 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2538269074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035733 / 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: 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: Nonmalleable Cryptography / 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: Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma / 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: Founding Cryptography on Oblivious Transfer – Efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round-Efficient Black-Box Construction of Composable Multi-Party Computation / 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: Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-Box Constructions of Composable Protocols without Set-Up / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent Non-malleable Commitments from Any One-Way Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified framework for concurrent security / 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: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit commitment using pseudorandomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting Lower and Upper Bounds for Selective Decommitments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations / rank
 
Normal rank
Property / cites work
 
Property / cites work: New notions of security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250778 / 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 04:24, 13 July 2024

scientific article
Language Label Description Also known as
English
Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
scientific article

    Statements

    Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions (English)
    0 references
    21 December 2016
    0 references
    UC security
    0 references
    adaptive secure computation
    0 references
    coin-tossing
    0 references
    black-box construction
    0 references
    extractable commitments
    0 references
    zero-one law
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers