Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Siguna Müller

dblp:98/2693 · DBLP profile ↗
← Back
7ranked-venue papers
7as first author
0since 2021 · last 2016
0000-0002-2016-5027ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 6 · 6 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
2 papers
Cryptographic primitives and cryptanalysis · 100%

Topics — the 1 heaviest of 1, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › computational number theory
primality testing
0.122003
A Probable Prime Test with Very High Confidence for n L 3 mod 4 · J. Cryptol. 2003
A Probable Prime Test with Very High Confidence for n equiv 1 mod 4 · ASIACRYPT 2001
YearPublicationVenuePosition
2016 A covert authentication and security solution for GMOs
abstract
BACKGROUND: Proliferation and expansion of security risks necessitates new measures to ensure authenticity and validation of GMOs. Watermarking and other cryptographic methods are available which conceal and recover the original signature, but in the process reveal the authentication information. In many scenarios watermarking and standard cryptographic methods are necessary but not sufficient and new, more advanced, cryptographic protocols are necessary. RESULTS: Herein, we present a new crypto protocol, that is applicable in broader settings, and embeds the authentication string indistinguishably from a random element in the signature space and the string is verified or denied without disclosing the actual signature. Results show that in a nucleotide string of 1000, the algorithm gives a correlation of 0.98 or higher between the distribution of the codon and that of E. coli, making the signature virtually invisible. CONCLUSIONS: This algorithm may be used to securely authenticate and validate GMOs without disclosing the actual signature. While this protocol uses watermarking, its novelty is in use of more complex cryptographic techniques based on zero knowledge proofs to encode information.
Siguna Müller, Farhad Jafari, Don Roth
BMC Bioinform.1
2004 On the Computation of Square Roots in Finite Fields
Siguna Müller
Des. Codes Cryptogr.1
2003 A Probable Prime Test with Very High Confidence for n L 3 mod 4
Siguna Müller
J. Cryptol.1
2001 A Probable Prime Test with Very High Confidence for n equiv 1 mod 4
Siguna Müller
ASIACRYPT1
1999 On the Security of an RSA Based Encryption Scheme
Siguna Müller
ACISP1
1999 On the Combined Fermat/Lucas Probable Prime Test
Siguna Müller
IMACC1
1998 The Security of Public Key Cryptosystems Based on Integer Factorization
Siguna Müller, Winfried B. Müller
ACISP1