The representation problem based on factoring

DOI10.1007/3-540-45760-7_8MaRDI QIDQ4472068zbMATH OpenFDO

Authors Roger Fischlin, Marc Fischlin

Publication date 3 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2271/22710096.htm, http://publikationen.ub.uni-frankfurt.de/files/4229/fischlin.factoring_representation.2002.pdf

Mathematics Subject Classification ID

Factorization (11Y05) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Short proofs of knowledge for factoring
• The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
• A bivariate polynomial-based cryptographic hard problem and its applications
• Pseudo-random functions and factoring (extended abstract)
• Cryptoschemes based on difficulty of simultaneous solving two different difficult problems

Cited in

(12)

• Security proofs for identity-based identification and signature schemes
• Efficient commitment schemes with bounded sender and unbounded receiver
• Mercurial commitments with applications to zero-knowledge sets
• scientific article; zbMATH DE number 6381750 (Why is no real title available?)
• The Independent Even Factor Problem
• Concurrent non-malleable statistically hiding commitment
• Bounded tamper resilience: how to go beyond the algebraic barrier
• Efficient non-malleable commitment schemes
• Efficient non-malleable commitment schemes
• A bivariate polynomial-based cryptographic hard problem and its applications
• Non-malleable subvector commitments
• Non-interactive and non-malleable commitment scheme based on q-one way group homomorphisms

This page was built for publication: The representation problem based on factoring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472068)