Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Alexandros Zacharakis"'
Publikováno v:
Journal of Computer Security. 29:229-271
This work formalizes Publicly Auditable Conditional Blind Signatures (PACBS), a new cryptographic primitive that allows the verifiable issuance of blind signatures, the validity of which is contingent upon a predicate and decided by a designated veri
Publikováno v:
Advances in Cryptology – ASIACRYPT 2022 ISBN: 9783031229718
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b0748144fe563679a8b10fd33d19dc7
https://doi.org/10.1007/978-3-031-22972-5_7
https://doi.org/10.1007/978-3-031-22972-5_7
Publikováno v:
Cyber Security, Cryptology, and Machine Learning ISBN: 9783031076886
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::51860e7fb62a4842b5680e8d9f91cc9b
https://doi.org/10.1007/978-3-031-07689-3_24
https://doi.org/10.1007/978-3-031-07689-3_24
Autor:
Alonso González, Alexandros Zacharakis
Publikováno v:
TCC 2021-19th International Conference Theory of Cryptography
TCC 2021-19th International Conference Theory of Cryptography, Nov 2021, Raleigh, United States. pp.1-79, ⟨10.1007/978-3-030-90459-3_18⟩
19th International Conference, TCC 2021
19th International Conference, TCC 2021, Nov 2021, Raleigh, United States. pp.1-79
Theory of Cryptography ISBN: 9783030904586
TCC (1)
TCC 2021-19th International Conference Theory of Cryptography, Nov 2021, Raleigh, United States. pp.1-79, ⟨10.1007/978-3-030-90459-3_18⟩
19th International Conference, TCC 2021
19th International Conference, TCC 2021, Nov 2021, Raleigh, United States. pp.1-79
Theory of Cryptography ISBN: 9783030904586
TCC (1)
International audience; We construct a publicly verifiable, non-interactive delegation scheme for any polynomial size arithmetic circuit with proof-size and verification complexity comparable to those of pairing based zk-SNARKS. Concretely, the proof
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b1f35d4112a76523c35409c95c17c3b8
https://hal.science/hal-03419735/document
https://hal.science/hal-03419735/document
Autor:
Alonso González, Alexandros Zacharakis
Publikováno v:
Theory of Cryptography ISBN: 9783030904586
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::543e71a4dbdd0ff03e21f42cc3ade154
https://doi.org/10.1007/978-3-030-90459-3_26
https://doi.org/10.1007/978-3-030-90459-3_26
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030453732
Public Key Cryptography (1)
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Public-Key Cryptography – PKC 2020
Public-Key Cryptography – PKC 2020-23rd IACR International Conference on Practice and Theory of Public-Key Cryptography, Edinburgh, UK, May 4–7, 2020, Proceedings, Part I
Public Key Cryptography (1)
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Public-Key Cryptography – PKC 2020
Public-Key Cryptography – PKC 2020-23rd IACR International Conference on Practice and Theory of Public-Key Cryptography, Edinburgh, UK, May 4–7, 2020, Proceedings, Part I
Comunicació presentada a: 23rd IACR International Conference on Practice and Theory of Public-Key Cryptography celebrat del 4 al 7 de maig de 2020 a Edimburg, Escòcia. We propose an improvement for the inner product argument of Bootle et al. (EUROC
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6017b43ad5b8f010d242efa0020bdf1a
https://doi.org/10.1007/978-3-030-45374-9_18
https://doi.org/10.1007/978-3-030-45374-9_18
Publikováno v:
Financial Cryptography and Data Security ISBN: 9783662588192
Financial Cryptography Workshops
Financial Cryptography Workshops
In this work, we propose a first version of an e-voting scheme that achieves end-to-end verifiability, everlasting privacy and efficient coercion resistance in the JCJ setting. Everlasting privacy is achieved assuming an anonymous channel, without re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3aa2904d8c614ae5aaa8d674a539f6df
https://doi.org/10.1007/978-3-662-58820-8_15
https://doi.org/10.1007/978-3-662-58820-8_15
Publikováno v:
ISPAN-FCST-ISCC
We propose a novel framework to combine efficient coercion resistance with increased levels of privacy in electronic voting. Our scheme can be considered as an extension of the blind signature based voting protocol of Fujioka, Okamoto and Ohta (FOO)