Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions

From MaRDI portal
Publication:4911575

DOI10.1007/978-3-642-34961-4_3zbMath1292.94016OpenAlexW174958306MaRDI QIDQ4911575

Bernardo David, Ryo Nishimaki, Melissa Chase, Miyako Ohkubo, Masayuki Abe, Markulf Kohlweiss

Publication date: 19 March 2013

Published in: Advances in Cryptology – ASIACRYPT 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-34961-4_3




Related Items (27)

Structure-preserving signatures and commitments to group elementsTightly secure signatures and public-key encryptionStructure-Preserving Signatures from Standard Assumptions, RevisitedShort Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple AssumptionsConstant-size structure-preserving signatures: generic constructions and simple assumptionsMore efficient structure-preserving signatures -- or: bypassing the type-III lower boundsEfficient Distributed Tag-Based Encryption and Its Application to Group Signatures with Efficient Distributed TraceabilityLinearly homomorphic structure-preserving signatures and their applicationsStructure-Preserving Smooth Projective HashingSignature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice AssumptionsHow to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving OnesStructure-preserving signatures on equivalence classes and constant-size anonymous credentialsThe Kernel Matrix Diffie-Hellman AssumptionAdaptively simulation-secure attribute-hiding predicate encryptionImproved inner-product encryption with adaptive security and full attribute-hidingVerifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VESTagged One-Time Signatures: Tight Security and Optimal Tag SizeVerifiably Encrypted Signatures with Short Keys Based on the Decisional Linear Problem and Obfuscation for Encrypted VESImproved Structure Preserving Signatures Under Standard Bilinear AssumptionsStructure-Preserving Chosen-Ciphertext Security with Shorter Verifiable CiphertextsStronger Security Notions for Decentralized Traceable Attribute-Based Signatures and More Efficient ConstructionsPractical Round-Optimal Blind Signatures in the Standard Model from Weaker AssumptionsDesign in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer ProgrammingLeakage resilience from program obfuscationReal Hidden Identity-Based SignaturesShorter non-interactive zero-knowledge arguments and ZAPs for algebraic languagesPartially structure-preserving signatures: lower bounds, constructions and more




This page was built for publication: Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions