Unprovable security of perfect NIZK and non-interactive non-malleable commitments (Q332270): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94A60 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6645062 / rank
 
Normal rank
Property / zbMATH Keywords
 
cryptography
Property / zbMATH Keywords: cryptography / rank
 
Normal rank
Property / zbMATH Keywords
 
black-box separations
Property / zbMATH Keywords: black-box separations / rank
 
Normal rank
Property / zbMATH Keywords
 
non-malleable commitments
Property / zbMATH Keywords: non-malleable commitments / rank
 
Normal rank
Property / zbMATH Keywords
 
non-interactive zero-knowledge
Property / zbMATH Keywords: non-interactive zero-knowledge / rank
 
Normal rank
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/s00037-016-0122-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2339198682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect NIZK with Adaptive Soundness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On basing one-way functions on NP-hardness / 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: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4409116 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme / 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: On Worst‐Case to Average‐Case Reductions for NP Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking RSA may not be equivalent to factoring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativized cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separation Results on the “One-More” Computational Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resettable zero-knowledge (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The random oracle methodology, revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of nonuniformity in proofs of security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancements of trapdoor permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Generic Insecurity of the Full Domain Hash / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmalleable Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random-Self-Reducibility of Complete Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Impossibility of Three-Move Blind Signature Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating succinct non-interactive arguments from all falsifiable assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Cryptographic Applications of Random Functions (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Composition of 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: Constant round non-malleable protocols using one way functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Non-interactive Zero Knowledge for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the (Im)Possibility of Key Dependent Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Pseudorandom Generator from any One-way Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Parallel Repetition Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chernoff-Type Direct Product Theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-malleability amplification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-round non-malleable commitments from any one-way function / 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: Q4474186 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive One-Way Functions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits of provable security from standard assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: New and improved constructions of non-malleable cryptographic protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconditional Characterizations of Non-interactive Zero-Knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Non-Black-Box Lower Bounds in Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Are PCPs inherent in efficient arguments? / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:34, 12 July 2024

scientific article
Language Label Description Also known as
English
Unprovable security of perfect NIZK and non-interactive non-malleable commitments
scientific article

    Statements

    Unprovable security of perfect NIZK and non-interactive non-malleable commitments (English)
    0 references
    0 references
    28 October 2016
    0 references
    cryptography
    0 references
    black-box separations
    0 references
    non-malleable commitments
    0 references
    non-interactive zero-knowledge
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers