Efficient non-malleable commitment schemes (Q5902225): 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 / OpenAlex ID
 
Property / OpenAlex ID: W1964370100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding smooth integers in short intervals using CRT decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum disclosure proofs of knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542539 / 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: Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack / 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: Q4409144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmalleable Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-knowledge proofs of identity / 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: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing / 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: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selecting cryptographic key sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474186 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - EUROCRYPT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast generation of prime numbers and secure public-key cryptographic parameters. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit commitment using pseudorandomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New notions of security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474234 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:53, 2 July 2024

scientific article; zbMATH DE number 5633140
Language Label Description Also known as
English
Efficient non-malleable commitment schemes
scientific article; zbMATH DE number 5633140

    Statements

    Efficient non-malleable commitment schemes (English)
    0 references
    0 references
    0 references
    13 November 2009
    0 references
    0 references
    Chinese remainder theorem
    0 references
    commitment
    0 references
    common reference string
    0 references
    non-malleability
    0 references
    proof of knowledge
    0 references
    trapdoor commitment
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references