نتایج جستجو برای: safavi
تعداد نتایج: 124 فیلتر نتایج به سال:
Seán M. Meenehan,1 Justin D. Cohen,1 Simon Gröblacher,1,2 Jeff T. Hill,1 Amir H. Safavi-Naeini,1 Markus Aspelmeyer,2 and Oskar Painter1,* 1Institute for Quantum Information and Matter and Thomas J. Watson, Sr., Laboratory of Applied Physics, California Institute of Technology, Pasadena, California 91125, USA 2Vienna Center for Quantum Science and Technology (VCQ), Faculty of Physics, University...
In the paper “New Results on Frame-Proof Codes and Traceability Schemes” by Reihaneh Safavi-Naini and Yejing Wang [IEEE Trans. Inform. Theory, vol. 47, no. 7, pp. 3029– 3033, Nov. 2001], there are lower bounds for the maximal number of codewords in binary frame-proof codes and decoders in traceability schemes. There are also existence proofs using a construction of binary frame-proof codes and ...
Simon Gröblacher,1, 2, ∗ Jeff T. Hill,1, 2, ∗ Amir H. Safavi-Naeini,1, 2, ∗ Jasper Chan,1 and Oskar Painter1, 2, 3, † 1Thomas J. Watson, Sr., Laboratory of Applied Physics, California Institute of Technology, Pasadena, CA 91125 2Institute for Quantum Information and Matter, California Institute of Technology, Pasadena, CA 91125 3Max Planck Institute for the Science of Light, Günther-Scharowsky-...
Farid Ya. Khalili,1 Haixing Miao,2 Huan Yang,2 Amir H. Safavi-Naeini,3 Oskar Painter,3 and Yanbei Chen2 1Physics Faculty, Moscow State University, Moscow 119991, Russia 2Theoretical Astrophysics 350-17, California Institute of Technology, Pasadena, California 91125, USA 3Thomas J. Watson, Sr. Laboratory of Applied Physics, California Institute of Technology, Pasadena, California 91125, USA (Rec...
Seán M. Meenehan, 2 Justin D. Cohen, 2 Simon Gröblacher, 2, 3 Jeff T. Hill, 2 Amir H. Safavi-Naeini, 2 Markus Aspelmeyer, and Oskar Painter 2, ∗ Thomas J. Watson, Sr., Laboratory of Applied Physics, California Institute of Technology, Pasadena, CA 91125, USA Institute for Quantum Information and Matter, California Institute of Technology, Pasadena, CA 91125, USA Vienna Center for Quantum Scienc...
In this paper, we construct an efficient “multi-receiver identity-based encryption scheme”. Our scheme only needs one (or none if precomputed and provided as a public parameter) pairing computation to encrypt a single message for n receivers, in contrast to the simple construction that re-encrypts a message n times using Boneh and Franklin’s identity-based encryption scheme, considered previous...
Alessandro Pitanti,1, 2 Johannes M. Fink,1 Amir H. Safavi-Naeini,1 Chan U. Lei,1 Jeff T. Hill,1 Alessandro Tredicucci,2, 3 and Oskar Painter1, ∗ 1Institute for Quantum Information and Matter and Thomas J. Watson, Sr., Laboratory of Applied Physics, California Institute of Technology, Pasadena, CA 91125, USA 2NEST and Istituto Nanoscienze CNR, Scuola Normale Superiore, Piazza San Silvestro 12, 5...
Seán M. Meenehan, ∗ Justin D. Cohen, ∗ Simon Gröblacher, 2, ∗ Jeff T. Hill, Amir H. Safavi-Naeini, Markus Aspelmeyer, and Oskar Painter † Institute for Quantum Information and Matter and Thomas J. Watson, Sr., Laboratory of Applied Physics, California Institute of Technology, Pasadena, CA 91125, USA Vienna Center for Quantum Science and Technology (VCQ), Faculty of Physics, University of Vienna...
Third-generation (3G) mobile phones are capable of high data rate Internet connection and promise seamless connectivity for a free roaming user. They can provide an "always on" Internet, and make a range of services, traditionally available on desktop computers, accessible to mobile users, irrespective of their location. Providing adequate security for these phones and the services that they of...
Amir H. Safavi-Naeini, 2, ∗ Simon Gröblacher, 2, ∗ Jeff T. Hill, 2, ∗ Jasper Chan, Markus Aspelmeyer, and Oskar Painter 2, 4, † Kavli Nanoscience Institute and Thomas J. Watson, Sr., Laboratory of Applied Physics, California Institute of Technology, Pasadena, CA 91125 Institute for Quantum Information and Matter, California Institute of Technology, Pasadena, CA 91125 Vienna Center for Quantum S...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید