Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Sabine Oechsner"'
Autor:
Carsten Baum, Bernardo David, Rafael Dowsley, Ravi Kishore, Jesper Buus Nielsen, Sabine Oechsner
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031313677
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::857ad521dbd13f45e2a8b69e2aacc513
https://doi.org/10.1007/978-3-031-31368-4_16
https://doi.org/10.1007/978-3-031-31368-4_16
Publikováno v:
Dupressoir, F, Kohbrok, K & Oechsner, S 2022, Bringing State-Separating Proofs to EasyCrypt A Security Proof for Cryptobox . in Proceedings-2022 IEEE 35th Computer Security Foundations Symposium, CSF 2022 . Proceedings-IEEE Computer Security Foundations Symposium, vol. 2022-August, pp. 227-242, 35th IEEE Computer Security Foundations Symposium, CSF 2022, Haifa, Israel, 7/08/22 . https://doi.org/10.1109/CSF54842.2022.9919671
Machine-checked cryptography aims to reinforce confidence in the primitives and protocols that underpin all digital security. However, machine-checked proof techniques remain in practice difficult to apply to real-world constructions. A particular ch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b72d47a4bf3f2a2298f4b57f3f49d74a
https://www.pure.ed.ac.uk/ws/files/343423071/Bringing_State_DUPRESSOIR_DOA08042022_AFV_CC_BY.pdf
https://www.pure.ed.ac.uk/ws/files/343423071/Bringing_State_DUPRESSOIR_DOA08042022_AFV_CC_BY.pdf
Publikováno v:
CSF
Sidorenco, N, Oechsner, S & Spitters, B 2021, Formal security analysis of MPC-in-the-head zero-knowledge protocols . in 2021 IEEE 34th Computer Security Foundations Symposium (CSF) . IEEE, pp. 607-620, 34th IEEE Computer Security Foundations Symposium, Online, United States, 21/06/2021 . https://doi.org/10.1109/CSF51468.2021.00050
Sidorenco, N, Oechsner, S & Spitters, B 2021, ' Formal security analysis of MPC-in-the-head zero-knowledge protocols ', IACR Cryptol. ePrint Arch., s. 437 . < https://eprint.iacr.org/2021/437 >
Sidorenco, N, Oechsner, S & Spitters, B 2021, Formal security analysis of MPC-in-the-head zero-knowledge protocols . in 2021 IEEE 34th Computer Security Foundations Symposium (CSF) . IEEE, pp. 607-620, 34th IEEE Computer Security Foundations Symposium, Online, United States, 21/06/2021 . https://doi.org/10.1109/CSF51468.2021.00050
Sidorenco, N, Oechsner, S & Spitters, B 2021, ' Formal security analysis of MPC-in-the-head zero-knowledge protocols ', IACR Cryptol. ePrint Arch., s. 437 . < https://eprint.iacr.org/2021/437 >
Zero-knowledge proofs allow a prover to convince a verifier of the veracity of a statement without revealing any other information. An interesting class of zero-knowledge protocols are those following the MPC-in-the-head paradigm (Ishai et al., STOC
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6be1e02a54ea580a1e4ca3df0181a2a4
https://doi.org/10.1109/csf51468.2021.00050
https://doi.org/10.1109/csf51468.2021.00050
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030778828
EUROCRYPT (3)
EUROCRYPT (3)
Time-based primitives like time-lock puzzles (TLP) are finding widespread use in practical protocols, partially due to the surge of interest in the blockchain space where TLPs and related primitives are perceived to solve many problems. Unfortunately
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f0d93b3b1ebbd39441e00d5f47fbf03b
https://doi.org/10.1007/978-3-030-77883-5_15
https://doi.org/10.1007/978-3-030-77883-5_15
Autor:
Zahra Jafargholi, Sabine Oechsner
Publikováno v:
Progress in Cryptology – INDOCRYPT 2020 ISBN: 9783030652760
INDOCRYPT
INDOCRYPT
A garbling scheme enables one to garble a circuit C and an input x in a way that C(x) can be evaluated, but nothing else is revealed. Since the first construction by Yao, tremendous practical efficiency improvements for selectively secure garbling sc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d6749ac010fe8c39e122fde9287b3196
https://doi.org/10.1007/978-3-030-65277-7_33
https://doi.org/10.1007/978-3-030-65277-7_33
Publikováno v:
Public-Key Cryptography – PKC 2018
PKC 2018
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Public-Key Cryptography – PKC 2018
Damgård, I, Luo, J, Oechsner, S, Scholl, P & Simkin, M 2018, Compact Zero-Knowledge Proofs of Small Hamming Weight . in M Abdalla & R Dahab (eds), Public-Key Cryptography-PKC 2018 . vol. 10770, Springer VS, Cham, Lecture Notes in Computer Science (LNCS), no. 10770, pp. 530-560, 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2018, Rio de Janeiro, Brazil, 25/03/2018 . https://doi.org/10.1007/978-3-319-76581-5_18
Public-Key Cryptography – PKC 2018 ISBN: 9783319765808
Public Key Cryptography (2)
PKC 2018
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Public-Key Cryptography – PKC 2018
Damgård, I, Luo, J, Oechsner, S, Scholl, P & Simkin, M 2018, Compact Zero-Knowledge Proofs of Small Hamming Weight . in M Abdalla & R Dahab (eds), Public-Key Cryptography-PKC 2018 . vol. 10770, Springer VS, Cham, Lecture Notes in Computer Science (LNCS), no. 10770, pp. 530-560, 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2018, Rio de Janeiro, Brazil, 25/03/2018 . https://doi.org/10.1007/978-3-319-76581-5_18
Public-Key Cryptography – PKC 2018 ISBN: 9783319765808
Public Key Cryptography (2)
We introduce a new technique that allows to give a zero-knowledge proof that a committed vector has Hamming weight bounded by a given constant. The proof has unconditional soundness and is very compact: It has size independent of the length of the co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9134735f6c708732688823b1dd4e6870
Publikováno v:
Baum, C, Damgård, I, Lyubashevsky, V, Oechsner, S & Peikert, C 2018, More Efficient Commitments from Structured Lattice Assumptions . in D Catalano & R De Prisco (eds), Security and Cryptography for Networks . vol. 11035, Springer VS, Cham, Lecture Notes in Computer Science (LNCS), no. 11035, pp. 368-385, International Conference on Security and Cryptography for Networks, Amalfi, Italy, 05/09/2018 . https://doi.org/10.1007/978-3-319-98113-0_20
Security and Cryptography for Networks-11th International Conference, SCN 2018, Amalfi, Italy, September 5–7, 2018, Proceedings
Lecture Notes in Computer Science ISBN: 9783319981123
SCN
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Security and Cryptography for Networks
Security and Cryptography for Networks-11th International Conference, SCN 2018, Amalfi, Italy, September 5–7, 2018, Proceedings
Lecture Notes in Computer Science ISBN: 9783319981123
SCN
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Security and Cryptography for Networks
We present a practical construction of an additively homomorphic commitment scheme based on structured lattice assumptions, together with a zero-knowledge proof of opening knowledge. Our scheme is a design improvement over the previous work of Benham
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::069cf601b810220ae9adf796b15e8421
https://pure.au.dk/portal/da/publications/more-efficient-commitments-from-structured-lattice-assumptions(e87ed63e-44d2-442d-81dc-a4eb9ed70c12).html
https://pure.au.dk/portal/da/publications/more-efficient-commitments-from-structured-lattice-assumptions(e87ed63e-44d2-442d-81dc-a4eb9ed70c12).html
Publikováno v:
2018 IEEE 31st Computer Security Foundations Symposium (CSF)
Haagh, H, Karbyshev, A, Oechsner, S, Spitters, B & Strub, P 2018, Computer-Aided Proofs for Multiparty Computation with Active Security . in 2018 IEEE 31st Computer Security Foundations Symposium (CSF) . vol. 2018, IEEE, Oxford, Proceedings of the IEEE Computer Security Foundations Symposium, no. 31, pp. 119-131, 2018 IEEE 31st Computer Security Foundations Symposium (CSF), Oxford, United Kingdom, 09/07/2018 . https://doi.org/10.1109/CSF.2018.00016
CSF
Haagh, H, Karbyshev, A, Oechsner, S, Spitters, B & Strub, P 2018, Computer-Aided Proofs for Multiparty Computation with Active Security . in 2018 IEEE 31st Computer Security Foundations Symposium (CSF) . vol. 2018, IEEE, Oxford, Proceedings of the IEEE Computer Security Foundations Symposium, no. 31, pp. 119-131, 2018 IEEE 31st Computer Security Foundations Symposium (CSF), Oxford, United Kingdom, 09/07/2018 . https://doi.org/10.1109/CSF.2018.00016
CSF
Secure multi-party computation (MPC) is a general cryptographic technique that allows distrusting parties to compute a function of their individual inputs, while only revealing the output of the function. It has found applications in areas such as au
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::60cf73150c6043837e509d2635738a4a
Publikováno v:
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Information and Communications Security
Baum, C, Lin, H & Oechsner, S 2018, Towards Practical Lattice-Based One-Time Linkable Ring Signatures . in D Naccache, S Xu, S Qing, P Samarati, G Blanc, R Lu, Z Zhang & A Meddahi (eds), Information and Communications Security : ICICS 2018 . vol. 11149, Springer VS, Cham, Lecture Notes in Computer Science (LNCS), no. 11149, pp. 303-322, International Conference on Information and Communications Security, Lille, France, 29/10/2018 . https://doi.org/10.1007/978-3-030-01950-1_18
Information and Communications Security-20th International Conference, ICICS 2018, Lille, France, October 29-31, 2018, Proceedings
Information and Communications Security ISBN: 9783030019495
ICICS
Lecture Notes in Computer Science-Information and Communications Security
Baum, C, Lin, H & Oechsner, S 2018, Towards Practical Lattice-Based One-Time Linkable Ring Signatures . in D Naccache, S Xu, S Qing, P Samarati, G Blanc, R Lu, Z Zhang & A Meddahi (eds), Information and Communications Security : ICICS 2018 . vol. 11149, Springer VS, Cham, Lecture Notes in Computer Science (LNCS), no. 11149, pp. 303-322, International Conference on Information and Communications Security, Lille, France, 29/10/2018 . https://doi.org/10.1007/978-3-030-01950-1_18
Information and Communications Security-20th International Conference, ICICS 2018, Lille, France, October 29-31, 2018, Proceedings
Information and Communications Security ISBN: 9783030019495
ICICS
Ring signatures, as introduced by Rivest, Shamir, and Tauman (Asiacrypt ’01), allow to generate a signature for a message on behalf of an ad-hoc set of parties. To sign a message, only the public keys must be known and these can be generated indepe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3019e25a39d53e85f7b1a8d903b711b1