Tweetovi

Blokirali ste korisnika/cu @Karim7415953

Jeste li sigurni da želite vidjeti te tweetove? Time nećete deblokirati korisnika/cu @Karim7415953

  1. 18. pro 2019.

    Very happy to present the results here at 17th IMA International Conference on Cryptography and Coding (IMACC'19), University of Oxford. Nice people and nice discussions :) Slides of the talk are available on

    Poništi
  2. proslijedio/la je Tweet
    22. lis 2019.

    ✋Stop right there! We know that sometimes you don't want to peel the potato to eat the chips! No worries! Here's all peeled and ready for consumption for you! A video about PRIViLEDGE's solutions for in ! 🎥

    Poništi
  3. 16. lis 2019.

    Are you interested on zk-SNARKs and their privacy-preserving applications including cryptocurrencies, smart contracts and private PoS (Zcash, Hawk, Ouroboros Crypsinous), join us this week at Universitat Pompeu Fabra. ,,,,

    Poništi
  4. 16. lis 2019.

    Shahla Atapoor explains how efficiently one can achieve simulation extractability (that guarantees non-malleability of proofs) in Groth's zk-SNARK More details in , , , ,

    Poništi
  5. 7. lis 2019.

    In this research, we explained how to construct a zk-SNARK that guarantees the non-malleability of proofs and the prover does not need to trust CRS generators to achieve ZK. , ,

    Poništi
  6. proslijedio/la je Tweet
    3. lis 2019.

    Okay, so you know that zk-SNARKs provide privacy-preserving payments & interconnections in smart contracts. Do you also know how efficiency of such systems can be improved? No? Great news! has just the right article for you 👉

    Poništi
  7. proslijedio/la je Tweet
    2. lis 2019.

    Breaking Anonymity of Some Recent Lightweight RFID Authentication Protocols: K Baghery, B Abdolmaleki, S Khazaei, MR Aref

    Poništi
  8. 21. ruj 2019.

    In this research, we study security of commitment schemes in face of a maliciously chosen commitment key and present both negative and positive results about constructing subversion-resistant commitment schemes. ,

    Poništi
  9. 13. ruj 2019.

    In this presentation, we discussed how much one can mitigate the trust in the setup phase of zk-SNARKs and construct more efficient UC-secure zk-SNARKs. , ,

    Poništi
  10. proslijedio/la je Tweet
    12. ruj 2019.

    COSIC seminar – Overview on Zcash and an Efficient zk-SNARK with Non-malleable Proofs – Shahla Atapoor (University of Tartu)

    Poništi
  11. 8. srp 2019.

    Given efficient non-black-box simulation extractable zk-SNARKs (i.e. ones in ) one can construct UC-secure zk-SNARKs by adding lin-long commitment and a SNARK proof for c=enc(w; r)∧(x, w)∈R. Read more on .

    Poništi
  12. proslijedio/la je Tweet
    19. lip 2019.

    We have risen to the 301st place in the QS World University Rankings published today: .

    Poništi
  13. 7. lip 2019.

    We had nice discussions on our DL-extractable UC-secure commitment scheme here in ACNS 2019 in Bogotá. You may read more about the scheme in . ,

    Poništi
  14. 3. lip 2019.

    Making Groth's SNARK simulation extractable by some changes in original language using an OR construction. In practice overload has minimal effects on the efficiency. Proofs will be less than 200B yet (for 128-bit sec). New verification requires only an extra pairing (4 parings).

    Poništi
  15. 15. svi 2019.

    A variation of Groth and Maller's zk-SNARK allows us to achieve UC-security and better efficiency than the ones that currently are used in privacy-preserving smart contract systems such as and . More details on ,

    Poništi
  16. 15. svi 2019.

    In this paper we explain how one can use our new DL-Extractable UC-Secure commitment scheme in and construct a UC-secure CRS generation protocol for zk-SNARKs. ,

    Poništi
  17. 10. sij 2019.

    PENCIL, a workshop on Privacy-ENhancing Cryptography In Ledgers, aims at discussing questions of confidentiality, privacy, scalability, and integrity in the context of distributed ledger technologies and cryptocurrencies. You may read more on

    Poništi
  18. proslijedio/la je Tweet
    29. stu 2018.

    We are ranked 251-300 worldwide for Computer Science by the 2019 Times Higher Education World University Rankings:

    UT ranked 251-300 for computer science
    Poništi
  19. 16. kol 2018.

    A unique experience with series of talks at Sharif University of Technology and ITRC with focus on zk-SNARKs and Bitcoin lightning networks.

    Poništi
  20. proslijedio/la je Tweet
    26. lip 2018.
    Poništi

Čini se da učitavanje traje već neko vrijeme.

Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.

    Možda bi vam se svidjelo i ovo:

    ·