June 2023 - seminar-cqi

by Stefan Wolf

good day, you are all cordially invited to a discussion event with our guest claude crepeau this afternoon at 15:00 in the meeting room in the 5th floor. it includes a reenactment of a talk in vienna on a presentation in les diablerets on "no-cloning without quantum", as well as remarks on integer factoring. hope to see you there! stefan

10 months, 1 week

1
0
0 / 0

Informatics Seminar on Tuesday, June 27, 11:00-12:00 - Claude Crépeau

by Stefan Wolf

> > > > Università > della > Svizzera > italiana > > INF > > usi > <https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnewslet...> > > Informatics Seminar > > Browser version > <https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnewslet...> > arrow > <https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnewslet...> > > > > main_banner > > > > > Experimental relativistic zero-knowledge proofs > > > > > > > Host: prof. Stefan Wolf > > Tuesday > 27.06 > > > USI East Campus, Sector D, room D0.02 > 11:00 - 12:00 > > > > > Claude Crépeau > McGill University, Canada > > > > Abstract: Protecting secrets is a key challenge in our contemporary > information-based era. In common situations, however, revealing > secrets appears unavoidable, for instance, when identifying oneself in > a bank to retrieve money. In turn, this may have highly undesirable > consequences in the unlikely, yet not unrealistic, case where the > bank’s security gets compromised. This naturally raises the question > of whether disclosing secrets is fundamentally necessary for > identifying oneself, or more generally for proving a statement to be > correct. Developments in computer science provide an elegant solution > via the concept of zero-knowledge proofs: a prover can convince a > verifier of the validity of a certain statement without facilitating > the elaboration of a proof at all. In this work, we report the > experimental realisation of such a zero-knowledge protocol involving > two separated verifier-prover pairs. Security is enforced via the > physical principle of special relativity, and no computational > assumption (such as the existence of one-way functions) is > required.Our implementation exclusively relies on off-the-shelf > equipment and works at both short (60m) and long distances (>400m) in > about one second. This demonstrates the practical potential of > multi-prover zero-knowledge protocols, promising for identification tasks. > > Joint work with Pouriya Alikhani, Nicolas Brunner, Sébastien > Designolle, Raphaël Houlmann, Weixu Shi, Nan Yang, and Hugo Zbinden in > Nature, https://www.nature.com/articles/s41586-021-03998-y > > Biography: > Claude Crépeau received a Ph.D. from MIT in 1990. He later was a > postdoc at the Université Paris-Sud and has been a CNRS researcher at > the École Normale Supérieure, Paris, from 1991 to 2005. He has been an > Associate Professor at the Université de Montréal from 1995 to 1998 > and is an Associate Professor at McGill University since 1998. He has > served from 1991 to 1995 as an Associate Editor of the Journal of > Cryptology. He later served as the Associate Editor for Complexity and > Cryptography of the IEEE Transactions on Information Theory from 1995 > to 1997. In 2013, he was elected a Fellow of the International > Association for Cryptologic Research. In 2023, he received the E.H. > Dijkstra prize for Distributed Computing. Claude has worked > extensively at the design of cryptographic protocols, including > Zero-knowledge protocols, and Multiparty Computations. His major > contribution has been to offer alternative assumptions under which > such protocols may be implemented using noisy channels and quantum > channels. In 1993, together with five international colleagues, he > published a paper introducing the new concept of "quantum > teleportation". The future the "quantum internet" is going to be based > on quantum teleportation. His latest research has lead to a practical > implementation of zero-knowledge proofs where soundness is guaranteed > by Special Relativity. > <https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnewslet...> > > > *Università > della > Svizzera > italiana* > > > *Quicklinks:* > INF Website > <https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnewslet...> > > INF Newsletter Archive > <https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnewslet...> > > Campus Lugano > <https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnewslet...> > > > *Follow us:* > <https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnewslet...> > <https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnewslet...> <https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnewslet...> <https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnewslet...> <https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnewslet...> > > *Unsubscribe*here > <https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnewslet...> > *Reports*decanato.inf(a)usi.ch > <https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnewslet...> > > > >

10 months, 1 week

1
0
0 / 0

Informatics Seminar on Tuesday, June 27, 11:00-12:00 - Claude Crépeau

by Stefan Wolf

> > > > Università > della > Svizzera > italiana > > INF > > usi > <https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnewslet...> > > Informatics Seminar > > Browser version > <https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnewslet...> > arrow > <https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnewslet...> > > > > main_banner > > > > > Experimental relativistic zero-knowledge proofs > > > > > > > Host: prof. Stefan Wolf > > Tuesday > 27.06 > > > USI East Campus, Sector D, room D0.02 > 11:00 - 12:00 > > > > > Claude Crépeau > McGill University, Canada > > > > Abstract: Protecting secrets is a key challenge in our contemporary > information-based era. In common situations, however, revealing > secrets appears unavoidable, for instance, when identifying oneself in > a bank to retrieve money. In turn, this may have highly undesirable > consequences in the unlikely, yet not unrealistic, case where the > bank’s security gets compromised. This naturally raises the question > of whether disclosing secrets is fundamentally necessary for > identifying oneself, or more generally for proving a statement to be > correct. Developments in computer science provide an elegant solution > via the concept of zero-knowledge proofs: a prover can convince a > verifier of the validity of a certain statement without facilitating > the elaboration of a proof at all. In this work, we report the > experimental realisation of such a zero-knowledge protocol involving > two separated verifier-prover pairs. Security is enforced via the > physical principle of special relativity, and no computational > assumption (such as the existence of one-way functions) is > required.Our implementation exclusively relies on off-the-shelf > equipment and works at both short (60m) and long distances (>400m) in > about one second. This demonstrates the practical potential of > multi-prover zero-knowledge protocols, promising for identification tasks. > > Joint work with Pouriya Alikhani, Nicolas Brunner, Sébastien > Designolle, Raphaël Houlmann, Weixu Shi, Nan Yang, and Hugo Zbinden in > Nature, https://www.nature.com/articles/s41586-021-03998-y > > Biography: > Claude Crépeau received a Ph.D. from MIT in 1990. He later was a > postdoc at the Université Paris-Sud and has been a CNRS researcher at > the École Normale Supérieure, Paris, from 1991 to 2005. He has been an > Associate Professor at the Université de Montréal from 1995 to 1998 > and is an Associate Professor at McGill University since 1998. He has > served from 1991 to 1995 as an Associate Editor of the Journal of > Cryptology. He later served as the Associate Editor for Complexity and > Cryptography of the IEEE Transactions on Information Theory from 1995 > to 1997. In 2013, he was elected a Fellow of the International > Association for Cryptologic Research. In 2023, he received the E.H. > Dijkstra prize for Distributed Computing. Claude has worked > extensively at the design of cryptographic protocols, including > Zero-knowledge protocols, and Multiparty Computations. His major > contribution has been to offer alternative assumptions under which > such protocols may be implemented using noisy channels and quantum > channels. In 1993, together with five international colleagues, he > published a paper introducing the new concept of "quantum > teleportation". The future the "quantum internet" is going to be based > on quantum teleportation. His latest research has lead to a practical > implementation of zero-knowledge proofs where soundness is guaranteed > by Special Relativity. > <https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnewslet...> > > > *Università > della > Svizzera > italiana* > > > *Quicklinks:* > INF Website > <https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnewslet...> > > INF Newsletter Archive > <https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnewslet...> > > Campus Lugano > <https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnewslet...> > > > *Follow us:* > <https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnewslet...> > <https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnewslet...> <https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnewslet...> <https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnewslet...> <https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnewslet...> > > *Unsubscribe*here > <https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnewslet...> > *Reports*decanato.inf(a)usi.ch > <https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fnewslet...> > > > >

10 months, 1 week

1
0
0 / 0

Veronika Baumann talks tomorrow

by Stefan Wolf

buona serata, I hope you are well! tomorrow, there will be two presentations by our guest veronika baumann from iqoqi and tu vienna. the first one will be at 11:00 in the fifth floor's meeting room, and the second at 16:00 in the interior court if weather permits. hope to see you all tomorrow! stefan 11:00 Title: Different perspectives in (non)-causal quantum processes processes Abstract: The process matrix framework was developed to allow for scenarios with indefinite or quantum causal order, a phenomenon that is expected to be relevant for quantum gravity. A popular approach towards a quantum theory of gravity is the Page-Wootters formalism, which describes time-evolution of systems via correlations between a clock system and other quantum systems encoded in history states. We combined the process matrix framework with a generalization of the Page-Wootters formalism with multiple clocks. Each of these clocks can be thought of as corresponding to an agent and conditioning on a certain clock gives the respective agent’s perspective inside an a priori general quantum process. We implemented scenarios where different definite causal orders are coherently controlled and explain why certain non-causal processes might not be compatible with this framework. 16:00 Title: Psi, reality and interpretations of quantum theory Abstract: A random selection in agreement with the title :)

10 months, 3 weeks

1
0
0 / 0

AIT seminar today at 14:30

by Charles Alexandre Bédard

Hello everyone, The first session of the AIT seminar is today at 14:30, in the D1.14. Marilena Palomba will present: *Information distance*, Charles H. Bennett, Peter Gács, Ming Li, Paul MB Vitányi, and Wojciech H. Zurek (IEEE Transactions on information theory, 44(4):1407--1423, 1998) Pasquale Polverino will present: *Compression-based data mining of sequential data*, Eamonn Keogh, Stefano Lonardi, Chotirat Ann Ratanamahatana, Li Wei, Sang-Hee Lee, and John Handley (Data Mining and Knowledge Discovery, 14:99--129, 2007) The seminar will be live-streamed via Jitsi, https://meet.jit.si/cqi-demon-M6QW9V7YY. (Seminar webpage : https://cqi.inf.usi.ch/ait23.php) Best, Charles

11 months

1
3
0 / 0

2024

2023

seminar-cqi June 2023

2024

2023

seminar-cqi June 2023 ----- 2024 ----- May 2024 April 2024 March 2024 February 2024 January 2024 ----- 2023 ----- December 2023 November 2023 October 2023 September 2023 August 2023 July 2023 June 2023 May 2023 April 2023 March 2023

seminar-cqi June 2023