Constant-round adaptive zero-knowledge proofs for NP (Q903613): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Zong-yang Zhang / rank
 
Normal rank
Property / author
 
Property / author: Zhen Fu Cao / 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.1016/j.ins.2013.07.037 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1967524496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security and composition of multiparty cryptographic protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783717 / 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: Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On constant-round concurrent non-malleable proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New receipt-free voting scheme using double-trapdoor commitment / 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: Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of statistically hiding bit commitment schemes and fail-stop signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security of blind signatures under aborts and applications to adaptive oblivious transfer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptively secure broadcast, revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to construct constant-round zero-knowledge proof systems for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-box constructions for secure computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A language-dependent cryptographic primitive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4314040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5310362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical electronic auction scheme with strong anonymity and bidding privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptively Secure Two-Party Computation with Erasures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on constant-round zero-knowledge proofs of knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of security of Yao's protocol for two-party computation / 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: Adaptive zero-knowledge proofs and adaptively secure oblivious transfer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit commitment using pseudorandomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-Box Constructions of Two-Party Protocols from One-Way Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent non-malleable statistically hiding commitment / rank
 
Normal rank

Latest revision as of 08:41, 11 July 2024

scientific article
Language Label Description Also known as
English
Constant-round adaptive zero-knowledge proofs for NP
scientific article

    Statements

    Constant-round adaptive zero-knowledge proofs for NP (English)
    0 references
    0 references
    0 references
    0 references
    14 January 2016
    0 references
    0 references
    adaptive zero-knowledge proof
    0 references
    proofs of knowledge
    0 references
    trapdoor commitments
    0 references
    instance-dependent commitments
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references