Adaptive Pseudo-free Groups and Applications

DOI10.1007/978-3-642-20465-4_13zbMath1281.94018OpenAlexW2150649726MaRDI QIDQ3003384

Dario Fiore, Dario Catalano, Bogdan Warinschi

Publication date: 27 May 2011

Published in: Advances in Cryptology – EUROCRYPT 2011 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Special aspects of infinite or finite groups (20F99)

Related Items

Lattice-based linearly homomorphic signatures in the standard model, Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys, Pseudo-free families and cryptographic primitives, Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions, Linearly homomorphic structure-preserving signatures and their applications, Multi-key Homomorphic Authenticators, A compiler for multi-key homomorphic signatures for Turing machines, Algebraic (trapdoor) one-way functions: constructions and applications, Practical homomorphic message authenticators for arithmetic circuits, Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures, Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures, Pseudo-free families of computational universal algebras, Tight security for signature schemes without random oracles, Verifiable Pattern Matching on Outsourced Texts, A certain family of subgroups of \(\mathbb{Z}_{n}^{\star}\) is weakly pseudo-free under the general integer factoring intractability assumption