On the Necessary and Sufficient Assumptions for UC Computation (Q3408190): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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-642-11799-2_8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1529116701 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resettable zero-knowledge (extended abstract) / 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: Q4035738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-interactive and reusable non-malleable commitment schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Founding Cryptography on Oblivious Transfer – Efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impossibility results for universal composability in public-key models and with fixed inputs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified framework for concurrent security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model / 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: Theory of Cryptography / rank
 
Normal rank

Latest revision as of 11:21, 2 July 2024

scientific article
Language Label Description Also known as
English
On the Necessary and Sufficient Assumptions for UC Computation
scientific article

    Statements

    Identifiers