Constant-round adaptive zero-knowledge proofs for NP
type: Item
instance of: scholarly article
title: Constant-round adaptive zero-knowledge proofs for NP
zbMATH Open document ID: 1347.68189
author: Haojin Zhu
author: Zongyang Zhang
author: Zhenfu Cao
published in: Information Sciences
publication date: 2016-01-14T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6530457
zbMATH Keywords: adaptive zero-knowledge proof
zbMATH Keywords: proofs of knowledge
zbMATH Keywords: trapdoor commitments
zbMATH Keywords: instance-dependent commitments
MaRDI profile type: Publication
full work available at URL: j.ins.2013.07.037
OpenAlex ID: W1967524496
cites work: Q4228520
cites work: Security and composition of multiparty cryptographic protocols
cites work: Q4783717
cites work: Universally composable two-party and multi-party secure computation
cites work: Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments
cites work: On constant-round concurrent non-malleable proof systems
cites work: New receipt-free voting scheme using double-trapdoor commitment
cites work: Simple, Black-Box Constructions of Adaptively Secure Protocols
cites work: Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS
cites work: Q4941875
cites work: On the existence of statistically hiding bit commitment schemes and fail-stop signatures
cites work: Q3210166
cites work: Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security
cites work: Security of blind signatures under aborts and applications to adaptive oblivious transfer
cites work: Adaptively secure broadcast, revisited
cites work: Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
cites work: Foundations of Cryptography
cites work: How to construct constant-round zero-knowledge proof systems for NP
cites work: Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
cites work: Black-box constructions for secure computation
cites work: A language-dependent cryptographic primitive
cites work: Q4314040
cites work: Q5310362
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Practical electronic auction scheme with strong anonymity and bidding privacy
cites work: Adaptively Secure Two-Party Computation with Erasures
cites work: Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption
cites work: A note on constant-round zero-knowledge proofs of knowledge
cites work: A proof of security of Yao's protocol for two-party computation
cites work: Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
cites work: Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
cites work: Bit commitment using pseudorandomness
cites work: Black-Box Constructions of Two-Party Protocols from One-Way Functions
cites work: Theory of Cryptography
cites work: Concurrent non-malleable statistically hiding commitment
DOI: 10.1016/J.INS.2013.07.037
description: scientific article; zbMATH DE number 6530457