Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Michael Klooß"'
Publikováno v:
Theory of Cryptography ISBN: 9783031223174
The celebrated Fiat-Shamir transformation turns any public-coin interactive proof into a non-interactive one, which inherits the main security properties (in the random oracle model) of the interactive version. While originally considered in the cont
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fafdde2e46370ded5550849126b5f984
https://ir.cwi.nl/pub/32771
https://ir.cwi.nl/pub/32771
Publikováno v:
Proceedings on Privacy Enhancing Technologies, Vol 2020, Iss 1, Pp 165-194 (2020)
Proceedings on privacy enhancing technologies, 2020 (1), 165–194
Proceedings on privacy enhancing technologies, 2020 (1), 165–194
Black-box accumulation (BBA) is a building block which enables a privacy-preserving implementation of point collection and redemption, a functionality required in a variety of user-centric applications including loyalty programs, incentive systems, a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::115589d9f7bbd7930f6d4626b15e17cb
https://doi.org/10.2478/popets-2020-0010
https://doi.org/10.2478/popets-2020-0010
Autor:
Sebastian H. Faller, Pascal Baumer, Michael Klooß, Alexander Koch, Astrid Ottenhues, Markus Raiber
Publikováno v:
Cryptography and Coding ISBN: 9783030926403
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f38eedde2e21a25d82abe882bfeafde
https://doi.org/10.1007/978-3-030-92641-0_11
https://doi.org/10.1007/978-3-030-92641-0_11
Publikováno v:
EUROCRYPT 2021-Annual International Conference on the Theory and Applications of Cryptographic Techniques
EUROCRYPT 2021-Annual International Conference on the Theory and Applications of Cryptographic Techniques, Oct 2021, Zagreb, Croatia. pp.247-277, ⟨10.1007/978-3-030-77883-5_9⟩
Lecture Notes in Computer Science ISBN: 9783030778828
EUROCRYPT (3)
EUROCRYPT 2021-Annual International Conference on the Theory and Applications of Cryptographic Techniques, Oct 2021, Zagreb, Croatia. pp.247-277, ⟨10.1007/978-3-030-77883-5_9⟩
Lecture Notes in Computer Science ISBN: 9783030778828
EUROCRYPT (3)
We introduce a new approach for constructing range proofs. Our approach is modular, and leads to highly competitive range proofs under standard assumption, using less communication and (much) less computation than the state of the art methods, withou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1687c94306df7dd384f3a7accbbd66db
Publikováno v:
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – EUROCRYPT 2019
Advances in Cryptology – EUROCRYPT 2019-38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19–23, 2019, Proceedings, Part I
Advances in Cryptology – EUROCRYPT 2019 ISBN: 9783030176525
EUROCRYPT (1)
Lecture Notes in Computer Science-Advances in Cryptology – EUROCRYPT 2019
Advances in Cryptology – EUROCRYPT 2019-38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19–23, 2019, Proceedings, Part I
Advances in Cryptology – EUROCRYPT 2019 ISBN: 9783030176525
EUROCRYPT (1)
An updatable encryption scheme allows a data host to update ciphertexts of a client from an old to a new key, given so-called update tokens from the client. Rotation of the encryption key is a common requirement in practice in order to mitigate the i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3f1d9327d44b438c6196fae6ca0bd7d4
http://orbilu.uni.lu/handle/10993/50226
http://orbilu.uni.lu/handle/10993/50226
Publikováno v:
CCS
Zero-knowledge arguments have become practical, and widely used, especially in the world of Blockchain, for example in Zcash. This work revisits zero-knowledge proofs in the discrete logarithm setting. First, we identify and carve out basic technique
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::56222411ba4b1ec74a584a848648a419
http://orbilu.uni.lu/handle/10993/50224
http://orbilu.uni.lu/handle/10993/50224
Publikováno v:
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017, Dallas, United States
CCS
Recercat. Dipósit de la Recerca de Catalunya
instname
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017, Dallas, United States
CCS
Recercat. Dipósit de la Recerca de Catalunya
instname
Comunicació presentada a: the 2017 ACM SIGSAC Conference on Computer and Communications Security, celebrada del 30 d'octubre al 3 de novembre de 2017 a Dallas, Texas, Estats Units d'Amèrica. Bilinear groups form the algebraic setting for a multitud
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1b521fd79ae17d9595fca3047b146d74
https://hal.archives-ouvertes.fr/hal-01643558
https://hal.archives-ouvertes.fr/hal-01643558