A uniform-complexity treatment of encryption and zero-knowledge (Q1207696): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / cites work
 
Property / cites work: Q5750398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum disclosure proofs of knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-Knowledge Simulation of Boolean Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-round perfect zero-knowledge computationally convincing protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definitions and properties of zero-knowledge proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knowledge Complexity of Interactive Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Notion of Security for Probabilistic Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5751927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Theory of Secrecy Systems* / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:59, 17 May 2024

scientific article
Language Label Description Also known as
English
A uniform-complexity treatment of encryption and zero-knowledge
scientific article

    Statements

    A uniform-complexity treatment of encryption and zero-knowledge (English)
    0 references
    0 references
    0 references
    16 May 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    commitment schemes
    0 references
    encryption
    0 references
    zero-knowledge
    0 references
    uniform complexity measures
    0 references
    probabilistic polynomial-time machines
    0 references
    proof systems
    0 references