scientific article
From MaRDI portal
Publication:4035740
zbMath0789.68047MaRDI QIDQ4035740
Birgit Pfitzmann, David Chaum, Eugène van Heyst
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
zero-knowledge proofsdiscrete logarithmarithmetic formulascollision-free hash functionsundeniable signature schemes
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)
Related Items (30)
Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing ⋮ Attribute-based versions of Schnorr and ElGamal ⋮ A provably secure non-iterative hash function resisting birthday attack ⋮ Generic Transformation to Strongly Existentially Unforgeable Signature Schemes with Continuous Leakage Resiliency ⋮ A New Non-Merkle-Damgård Structural Hash Function with Provable Security ⋮ Identity-based encryption in DDH hard groups ⋮ Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography ⋮ Identity-based chameleon hashing and signatures without key exposure ⋮ CCA updatable encryption against malicious re-encryption attacks ⋮ Programmable hash functions and their applications ⋮ Short undeniable signatures based on group homomorphisms ⋮ A characterization of chameleon hash functions and new, efficient designs ⋮ Certificateless undeniable signature scheme ⋮ New \((t, n)\) threshold directed signature scheme with provable security ⋮ New Constructions and Applications of Trapdoor DDH Groups ⋮ Rate-Limited Secure Function Evaluation: Definitions and Constructions ⋮ Threshold undeniable signature scheme based on conic ⋮ Functional encryption for cascade automata ⋮ A Framework for Constructing Convertible Undeniable Signatures ⋮ VSH, an Efficient and Provable Collision-Resistant Hash Function ⋮ Certificateless undeniable signatures from bilinear maps ⋮ Programmable Hash Functions and Their Applications ⋮ On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles ⋮ Hash Functions from Sigma Protocols and Improvements to VSH ⋮ Functional Encryption for Cascade Automata (Extended Abstract) ⋮ Short fail-stop signature scheme based on factorization and discrete logarithm assumptions ⋮ New RSA-Based (Selectively) Convertible Undeniable Signature Schemes ⋮ Digital Signatures ⋮ Sanitizable Signatures ⋮ A randomized analog of Chaum - van Antwerpen undeniable signature
This page was built for publication:
