Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Benedikt Auerbach"'
Autor:
Andreas Kremling, Anna Goehler, Knut Jahreis, Markus Nees, Benedikt Auerbach, Wolfgang Schmidt-Heck, Öznur Kökpinar, Robert Geffers, Ursula Rinas, Katja Bettenbrock
Publikováno v:
Metabolites, Vol 2, Iss 4, Pp 844-871 (2012)
Metabolism and signalling are tightly coupled in bacteria. Combining several theoretical approaches, a core model is presented that describes transcriptional and allosteric control of glycolysis in Escherichia coli. Experimental data based on microar
Externí odkaz:
https://doaj.org/article/0052896b8f984fbe976ba087b35ee53a
Publikováno v:
Datenschutz und Datensicherheit - DuD. 43:706-712
Was verstehen wir heute, sechs Jahre nach den Snowden-Leaks, unter IT-Sicherheit und Privatheit in digitalen Kulturen? Dieser Frage gehen Benedikt Auerbach aus kryptographischer und Mary Shnayien aus medienwissenschaftlicher Perspektive nach. So besc
Autor:
Michael Walter, Suvradip Chakraborty, Benedikt Auerbach, Michelle Yeo, Guillermo Pascual-Perez, Karen Klein, Krzysztof Pietrzak
Publikováno v:
Topics in Cryptology – CT-RSA 2021 ISBN: 9783030755386
CT-RSA
CT-RSA
Automated contract tracing aims at supporting manual contact tracing during pandemics by alerting users of encounters with infected people. There are currently many proposals for protocols (like the “decentralized” DP-3T and PACT or the “centra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::835ba0dfa39b89a24969647cdd256d2d
https://doi.org/10.1007/978-3-030-75539-3_17
https://doi.org/10.1007/978-3-030-75539-3_17
Autor:
Krzysztof Pietrzak, Mirza Ahad Baig, Miguel Cueto Noval, Benedikt Auerbach, Guillermo Pascual-Perez, Joël Alwen, Michael Walter, Karen Klein
Publikováno v:
Theory of Cryptography ISBN: 9783030904555
TCC (3)
Lecture Notes in Computer Science, 13044
Theory of Cryptography
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Theory of Cryptography
TCC (3)
Lecture Notes in Computer Science, 13044
Theory of Cryptography
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Theory of Cryptography
Key trees are often the best solution in terms of transmission cost and storage requirements for managing keys in a setting where a group needs to share a secret key, while being able to efficiently rotate the key material of users (in order to recov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9a2251ebd164ff9bba29fc08253b31b2
https://doi.org/10.1007/978-3-030-90456-2_8
https://doi.org/10.1007/978-3-030-90456-2_8
Publikováno v:
Advances in Cryptology – EUROCRYPT 2020-39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10–14, 2020, Proceedings, Part III
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – EUROCRYPT 2020
Advances in Cryptology – EUROCRYPT 2020 ISBN: 9783030457266
EUROCRYPT (3)
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – EUROCRYPT 2020
Advances in Cryptology – EUROCRYPT 2020 ISBN: 9783030457266
EUROCRYPT (3)
For \(1\le m \le n\), we consider a natural m-out-of-n multi-instance scenario for a public-key encryption (PKE) scheme. An adversary, given n independent instances of PKE, wins if he breaks at least m out of the n instances. In this work, we are int
Publikováno v:
CT-RSA 2021
Publikováno v:
Topics in Cryptology – CT-RSA 2019 ISBN: 9783030126117
CT-RSA
CT-RSA
Lossy trapdoor functions (Peikert and Waters, STOC 2008 and SIAM J. Computing 2011) imply, via black-box transformations, a number of interesting cryptographic primitives, including chosen-ciphertext secure public-key encryption. Kiltz, O’Neill, an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::09b06de6f9473b13603b30c150702277
https://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&origin=inward&scp=85062794415
https://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&origin=inward&scp=85062794415
Autor:
Benedikt Auerbach, Bertram Poettering
Publikováno v:
Public-Key Cryptography – PKC 2018 ISBN: 9783319765808
Public Key Cryptography (2)
Public Key Cryptography (2)
Certain RSA-based protocols, for instance in the domain of group signatures, require a prover to convince a verifier that a set of RSA parameters is well-structured (e.g., that the modulus is the product of two distinct primes and that the exponent i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::50be063746a753a8fa300742ef3bfe65
https://doi.org/10.1007/978-3-319-76581-5_14
https://doi.org/10.1007/978-3-319-76581-5_14
Publikováno v:
Public-Key Cryptography – PKC 2018 ISBN: 9783319765778
Public Key Cryptography (1)
Public Key Cryptography (1)
We initiate the study of public-key encryption (PKE) schemes and key-encapsulation mechanisms (KEMs) that retain security even when public parameters (primes, curves) they use may be untrusted and subverted. We define a strong security goal that we c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e0cf05fcae8815442a4273d8868c2080
https://doi.org/10.1007/978-3-319-76578-5_12
https://doi.org/10.1007/978-3-319-76578-5_12
Publikováno v:
Advances in Cryptology – CRYPTO 2017 ISBN: 9783319636870
CRYPTO (1)
CRYPTO (1)
Cryptographic reductions typically aim to be tight by transforming an adversary \(\mathsf{A}\) into an algorithm that uses essentially the same resources as \(\mathsf{A}\). In this work we initiate the study of memory efficiency in reductions. We arg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf0fcbfe3fd7d3e2ffb7f98e1f96c71a
https://doi.org/10.1007/978-3-319-63688-7_4
https://doi.org/10.1007/978-3-319-63688-7_4