Publication:4472078
From MaRDI portal
zbMath1048.94513MaRDI QIDQ4472078
No author found.
Publication date: 3 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2271/22710244.htm
Related Items
Drawing Bobbin Lace Graphs, or, Fundamental Cycles for a Subclass of Periodic Graphs, Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures, Provably Secure (Broadcast) Homomorphic Signcryption, Sanitizable Signatures Revisited, Linearly Homomorphic Authenticated Encryption with Provable Correctness and Public Verifiability, Lattice-based linearly homomorphic signatures in the standard model, A new definition of homomorphic signature for identity management in mobile cloud computing, Algebraic (trapdoor) one-way functions: constructions and applications, Linearly homomorphic structure-preserving signatures and their applications, Spreading alerts quietly and the subgroup escape problem, Reasoning about XML update constraints, A simple transitive signature scheme for directed trees, On the statistical leak of the GGH13 multilinear map and some variants, Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions, An efficient homomorphic aggregate signature scheme based on lattice, Trusted computing with addition machines. II, Practical homomorphic message authenticators for arithmetic circuits, Identity-based quotable ring signature, Verifiable pattern matching on outsourced texts, Computing on authenticated data, Locating modifications in signed data for partial data integrity, Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge, Structure-preserving signatures on equivalence classes and constant-size anonymous credentials, Zero-Knowledge Authenticated Order Queries and Order Statistics on a List, Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures, Batch Verifiable Computation with Public Verifiability for Outsourcing Polynomials and Matrix Computations, Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees, Verifiable Pattern Matching on Outsourced Texts, Short Transitive Signatures for Directed Trees, Multi-key Homomorphic Authenticators, A Storage Efficient Redactable Signature in the Standard Model, Proxy Re-signatures in the Standard Model, Sanitizable and Deletable Signature, Short Redactable Signatures Using Random Trees
