News

Welcome to our blog. Browse and filter through all our posts using the options below.

61 to 66 of 97

24JUN 2019
Talks
Talk “Adaptive Recoding for Batched Network Coding”
On 5 July 2019 at 10 a.m., the following talk will be given in room no. 11.2.21: Adaptive Recoding for Batched Network Coding Abstract Batched network coding is a variation of random linear network coding which has low computational and storage costs. In order to adapt random fluctuations in the number of erasures in […]
Read more about Talk “Adaptive Recoding for Batched Network Coding”
19JUN 2019
General
„Atomic Multi-Channel Updates with Constant Collateralin Bitcoin-Compatible Payment-Channel Networks“ Accepted at ACM CCS 2019
The paper„Atomic Multi-Channel Updates with Constant Collateralin Bitcoin-Compatible Payment-Channel Networks“ by Christoph Egger (Friedrich-Alexander-Universität Erlangen-Nürnberg), Pedro Moreno-Sanchez (TU Wien) and Matteo Maffei (TU Wien) has been accepted at ACM CCS 2019.
Read more about „Atomic Multi-Channel Updates with Constant Collateralin Bitcoin-Compatible Payment-Channel Networks“ Accepted at ACM CCS 2019
31MAY 2019
Research
Three Papers Accepted at Crypto 2019
Three papers have been accepted at Crypto 2019: Trapdoor Hash Functions and their Applications Nico Döttling (CISPA Helmholtz Center), Sanjam Garg (University of California, Berkeley), Yuval Ishai (Technion), Giulio Malavolta (Carnegie Mellon University, Friedrich-Alexander University Erlangen-Nürnberg), Tamer Mour (Weizmann Institute of Science), Rafail Ostrovsky (University of California, Los Angeles) Homomorphic Time-Lock Puzzles and Applications Giulio Malavolta […]Three papers have been accepted at Crypto 2019: Trapdoor Hash Functions and their Applications Nico Döttling (CISPA Helmholtz Center), Sanjam Garg (University of California, Berkeley), Yuval Ishai (Technion), Giulio Malavolta (Carnegie Mellon University, Friedrich-Alexander University Erlangen-Nürnberg), Tamer Mour (Weizmann Institute of Science), Rafail Ostrovsky (University of California, Los Angeles) Homomorphic Time-Lock Puzzles and Applications Giulio Malavolta […]
Read more about Three Papers Accepted at Crypto 2019
13MAY 2019
Allgemein
Research Training Group on Cybercrime and Forensic Computer Science Approved
A new research training group on cybercrime and forensic computer science with the participation of the Chair of Applied Cryptography was approved by the German Research Foundation. The goal of the research training group is for experts of computer science and law to systematically explore the research area “criminal prosecution of cybercrime”. The press release […]
Read more about Research Training Group on Cybercrime and Forensic Computer Science Approved
29APR 2019
General
Christoph Egger as finalist at RuCTF competition
On 26-29 April 2019, Christoph Egger will participate together with FAU’s team FAUST as finalist at the RuCTF competition in Yekaterinburg.
Read more about Christoph Egger as finalist at RuCTF competition
21MAR 2019
Allgemein
„Omniring: Scaling Up Private Payments Without Trusted Setup – Formal Foundations and Construction of Ring Confidential Transactions with Log-size Proofs“ Accepted at Monero Konferenco
The paper „Omniring: Scaling Up Private Payments Without Trusted Setup – Formal Foundations and Construction of Ring Confidential Transactions with Log-size Proofs“ by Russell W. F. Lai, Viktoria Ronge, Tim Ruffing, Dominique Schröder, Sri Aravinda Krishnan Thyagarajan and Jiafan Wang has been accepted at Monero Konferenco 2019. Sri Aravinda Krishnan Thyagarajan will present the paper […]The paper „Omniring: Scaling Up Private Payments Without Trusted Setup – Formal Foundations and Construction of Ring Confidential Transactions with Log-size Proofs“ by Russell W. F. Lai, Viktoria Ronge, Tim Ruffing, Dominique Schröder, Sri Aravinda Krishnan Thyagarajan and Jiafan Wang has been accepted at Monero Konferenco 2019. Sri Aravinda Krishnan Thyagarajan will present the paper […]
Read more about „Omniring: Scaling Up Private Payments Without Trusted Setup – Formal Foundations and Construction of Ring Confidential Transactions with Log-size Proofs“ Accepted at Monero Konferenco