Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
type: Item
instance of: scholarly article
title: Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
zbMATH Open document ID: 1479.94326
DOI: 10.1007/978-3-030-77870-5_15
author: Shuichi Katsumata
author: Ryo Nishimaki
author: Shota Yamada
author: Takashi Yamakawa
publication date: 2021-12-08T00:00:00Z
Mathematics Subject Classification ID: 94A62
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 81P94
zbMATH DE Number: 7440587
zbMATH Keywords: blind-signature-conforming zero-knowledge
MaRDI profile type: Publication
full work available at URL: 978-3-030-77870-5 15
OpenAlex ID: W3159307892
cites work: Structure-preserving signatures and commitments to group elements
cites work: A framework for universally composable non-committing blind signatures
cites work: Lattice problems in NP ∩ coNP
cites work: Signatures on Randomizable Ciphertexts
cites work: Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
cites work: Q4739525
cites work: Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
cites work: Compact Round-Optimal Partially-Blind Signatures
cites work: Q3671884
cites work: Q2778843
cites work: Zaps and Their Applications
cites work: Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
cites work: Practical Round-Optimal Blind Signatures in the Standard Model
cites work: Round-Optimal Composable Blind Signatures in the Common Reference String Model
cites work: Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
cites work: A practical secret voting scheme for large scale elections
cites work: On the Impossibility of Three-Move Blind Signature Schemes
cites work: Efficient Round Optimal Blind Signatures
cites work: Efficient Round-Optimal Blind Signatures in the Standard Model
cites work: On Constructing 1-1 One-Way Functions
cites work: Definitions and properties of zero-knowledge proof systems
cites work: Round Optimal Blind Signatures
cites work: Efficient Non-interactive Proof Systems for Bilinear Groups
cites work: Smooth projective hashing and two-message oblivious transfer
cites work: Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions
cites work: Non-interactive non-malleability from quantum supremacy
cites work: Lower bounds and impossibility results for concurrent self composition
cites work: Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
cites work: Efficient oblivious transfer protocols
cites work: Q4434874
cites work: Limits of provable security from standard assumptions
cites work: A Framework for Efficient and Composable Oblivious Transfer
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: Beyond the Limitation of Prime-Order Bilinear Groups, and Round Optimal Blind Signatures
description: scientific article; zbMATH DE number 7440587