";s:4:"text";s:14891:" Professor Boneh heads the applied cryptography group and co-direct the computer security lab. He is the author of over a hundred publications in the field and is a Packard and Alfred P. Sloan fellow. ; 1969) è un informatico israeliano, noto come ricercatore nel campo della crittografia applicata e della sicurezza informatica Professor Boneh heads the applied cryptography group and co-direct the computer security lab. Professor Boneh received his Ph.D from Princeton University and joined Stanford in 1997.Loran is a radio-based navigation system originally designed for naval applications. These results provide insight into when and how GAs can beat competing methods.Collusion Resistant Broadcast Encryption With Short Ciphertexts and Private Keys.A Method for Fast Revocation of Public Key Certificates and Security Capabilities.Hierarchical Identity Based Encryption with Constant Size Ciphertext.Stickler: Defending against Malicious Content Distribution Networks in an Unmodified BrowserJae Hyun Ahn, J. H., Hohenberger, S., Boneh, D., Camenisch, J., Shelat, A., Waters, B.An Experimental Study of TLS Forward Secrecy DeploymentsNeuroscience Meets Cryptography: Crypto Primitives Secure Against Rubber Hose AttacksBojinov, H., Sanchez, D., Reber, P., Boneh, D., Lincoln, P.Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled CircuitsBoneh, D., Gentry, C., Gorbunov, S., Halevi, S., Nikolaenko, V., Segev, G., Vaikuntanathan, V., Vinayagamurthy, D.Privacy-Preserving Ridge Regression on Hundreds of Millions of RecordsNikolaenko, V., Weinsberg, U., Ioannidis, S., Joye, M., Boneh, D., Taft, N.Privacy-Preserving Ridge Regression on Hundreds of Millions of Records.Nikolaenko, V., Weinsberg, U., Ioannidis, S., Joye, M., Boneh, D., Taft, N.Message-Locked Encryption for Lock-Dependent Messages.Abadi, M., Boneh, D., Mironov, I., Raghunathan, A., Segev, G.Boneh, D., Lewi, K., Montgomery, H., Raghunathan, A.Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation.Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption.Private Database Queries Using Somewhat Homomorphic Encryption.Boneh, D., Gentry, C., Halevi, S., Wang, F., Wu, D.Ensuring high-quality randomness in cryptographic key generation.Function-Private Subspace-Membership Encryption and Its Applications.OSS: Using Online Scanning Services for Censorship Circumvention.Constrained Pseudorandom Functions and Their Applications.Nikolaenko, V., Ioannidis, S., Weinsberg, U., Joye, M., Taft, N., Boneh, D.Secure Signatures and Chosen Ciphertext Security in a Quantum Computing World.Attribute-Based Encryption for Arithmetic Circuits.Functional Encryption: A New Vision for Public-Key CryptographyLandwehr, C., Boneh, D., Mitchell, J. C., Bellovin, S. M., Landau, S., Lesk, M. E.StegoTorus: a camouflage proxy for the Tor anonymity system.Weinberg, Z., Wang, J., Yegneswaran, V., Briesemeister, L., Cheung, S., Wang, F., Boneh, D.SessionJuggler: Secure Web Login From an Untrusted Terminal Using Session Hijacking.Topalovic, E., Saeta, B., Huang, L., S., Jackson, C., Boneh, D.Ahn, J., H., Boneh, D., Camenisch, J., Hohenberger, S., Shelat, A., Waters, B.The case for prefetching and prevalidating TLS server certificates.Stark, E., Huang, L., S., Israni, D., Jackson, C., Boneh, D.Who Killed My Battery: Analyzing Mobile Browser Energy ConsumptionThiagarajan, N., Aggarwal, G., Nicoara, A., Boneh, D., Singh, J.The most dangerous code in the world: validating SSL certificates in non-browser software.Georgiev, M., Iyengar, S., Jana, S., Anubhai, R., Boneh, D., Shmatikov, V.Fifield, D., Hardison, N., Ellithorpe, J., Stark, E., Boneh, D., Dingledine, R.Neuroscience Meets Cryptography: Designing Crypto Primitives Secure Against Rubber Hose AttacksBojinov, H., Sanchez, D., Reber, P., Boneh, D., Lincoln, P.Targeted malleability: homomorphic encryption for restricted computations.Efficient Selective Identity-Based Encryption Without Random OraclesFinding composite order ordinary elliptic curves using the Cocks-Pinch methodBoneh, D., Dagdelen, O., Fischlin, M., Lehmann, A., Schaffner, C., Zhandry, M.Narayanan, A., Thiagarajan, N., Lakhani, M., Hamburg, M., Boneh, D.Boneh, D., Dagdelen, Ö., Fischlin, M., Lehmann, A., Schaffner, C., Zhandry, M.OpenConflict: preventing real time map hacks in online games.Bursztein, E., Hamburg, M., Lagarenne, J., Boneh, D.Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based SignaturesOpenConflict: Preventing Real Time Map Hacks in Online GamesBursztein, E., Hamburg, M., Lagarenne, J., Boneh, D.Reliable Location-Based Services from Radio Navigation SystemsAlgebraic pseudorandom functions with improved efficiency from the augmented cascade.Preventing pollution attacks in multi-source network coding.Busting frame busting: a study of clickjacking vulnerabilities at popular sites.Rydstedt, G., Bursztein, E., Boneh, D., Jackson, C.Toubiana, V., Narayanan, A., Boneh, D., Nissenbaum, H., Barocas, S.Bittau, A., Hamburg, M., Handley, M., Mazieres, D., Boneh, D.An analysis of private browsing modes in modern browsers.Aggarwal, G., Bursztein, E., Jackson, C., Boneh, D.Lattice basis delegation in fixed dimension and shorter ciphertext hierarchical IBEFraming attacks on smart phones and dumb routers: tap-jacking and geo-localization attacks.Rydstedt, G., Gourdin, B., Bursztein, E., Boneh, D.Preventing Pollution Attacks in Multi-source Network CodingJackson, C., Barth, A., Bortz, A., Shao, W., Boneh, D.Signing a Linear Subspace: Signature Schemes for Network Coding.XCS: cross channel scripting and its impact on web applications.Jackson, C., Barth, A., Bortz, A., Shao, W., Boneh, D.Homomorphic MACs: MAC-Based Integrity for Network Coding.Robust Location Tag Generation from Noisy Location Data for Security ApplicationsPhysical Pseudo Random Function in Radio Frequency Sources for SecurityQiu, D., De Lorenzo, D., Lo, S., Boneh, D., Enge, P.Homomorphic MACs: MAC-Based Integrity for Network CodingSigning a Linear Subspace: Signature Schemes for Network CodingXCS: Cross Channel Scripting and its Impact on Web ApplicationsShort signatures without random oracles and the SDH assumption in bilinear groupsOvershadow: A virtualization-based approach to retrofitting protection in commodity operating systemsChen, X., Garfinkel, T., Lewis, E. C., Subrahmanyam, P., Waldspurger, C. A., Boneh, D., Dwoskin, J., Ports, D. R.Generalized Identity Based and Broadcast Encryption SchemesGeneralized Identity Based and Broadcast Encryption Schemes.On The Impossibility of Basing Identity Based Encryption on Trapdoor Permutations.Boneh, D., Papakonstantinou, A., Rackoff, C., Vahlis, Y., Waters, B.Overshadow: A Virtualization-Based Approach to Retrofitting Protection in Commodity Operating Systems.Chen, M., Subrahmanyam, P., Waldspurger, C., Lewis, E., C., Garfinkel, T., Boneh, D.Circular-Secure Encryption from Decision Diffie-Hellman.On The Impossibility of Basing Identity Based Encryption on Trapdoor PermutationsBoneh, D., Papakonstantinou, P. A., Rackoff, C., Vahlis, Y., Waters, B.Circular-secure encryption from decision Diffie-HellmanBoneh, D., Kushilevitz, E., Ostrovsky, R., Skeith, W. E.Boneh, D., Kushilevitz, E., Ostrovsky, R., Skeith, W.Cryptographic Methods for Storing Ballots on a Voting Machine.Covert Channels in Privacy-Preserving Identification Systems.Conjunctive, subset, and range queries on encrypted data.Exposing private information by timing web applications.Space-Efficient Identity Based Encryption Without Pairings.Saint-Jean, F., Johnson, A., Boneh, D., Feigenbaum, J.Reducing Shoulder-surfing by Using Gaze-based Password Entry.Conjunctive, subset, and range queries on encrypted dataSaint-Jean, F., Johnson, A., Boneh, D., Feigenbaum, J.Jackson, C., Barth, A., Bortz, A., Shao, W., Boneh, D.Space-efficient identity based encryption without pairingsCovert Channels in Privacy-Preserving Identification SystemsChosen-ciphertext security from identity-based encryptionPrivate encrypted content distribution using private broadcast encryption.On the impossibility of efficiently combining collision resistant hash functions.A collusion resistant broadcast, trace and revoke system.Chosen Ciphertext Secure Public Key Threshold Encryption Without Random Oracles.Strongly Unforgeable Signatures Based on Computational Diffie-Hellman.SANE: A protection architecture for enterprise networks.Casado, M., Garfinkel, T., Akella, A., Freedman, M., Boneh, D., McKeown, N.Secure function evaluation with ordered binary decision diagrams.Fully Collusion Resistant Traitor Tracing With Short Ciphertexts and Private Keys.SANE: A protection architecture for enterprise networksCasado, M., Garfinkel, T., Akella, A., Freedman, M. J., Boneh, D., McKeown, N., Shenker, S.Privacy in encrypted content distribution using private broadcast encryptionChosen ciphertext secure public key threshold encryption without random oraclesFully collusion resistant traitor tracing with short ciphertexts and private keysStrongly unforgeable signatures based on computational Diffie-HellmanOn the impossibility of efficiently combining collision resistant hash functionsImproved efficiency for CCA-secure cryptosystems built using identity-based encryptionStronger Password Authentication Using Browser Extensions.Ross, B., Jackson, C., Miyake, N., Boneh, D., Mitchell, J.Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity Based Encryption.Collusion resistant broadcast encryption with short ciphertexts and private keysHierarchical identity based encryption with constant size ciphertextStronger password authentication using browser extensionsRoss, B., Jackson, C., Miyake, N., Boneh, D., Mitchell, J. C.On the Effectiveness of Address-Space RandomizationShacham, H., Page, M., Pfaff, B., Goh, E., Modadugu, N., Boneh, D.Efficient Selective Identity-Based Encryption Without Random Oracles.Secure Identity Based Encryption Without Random Oracles.Boneh, D., Crescenzo, G., Di, Ostrovsky, R., Persiano, G.Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.Secure identity based encryption without random oraclesEfficient selective-ID secure identity-based encryption without random oraclesAggregate and Verifiably Encrypted Signatures from Bilinear Maps.The Design and Implementation of Protocol-based Hidden Key Recovery.Flexible OS support and applications for trusted computing.Terra: A Virtual Machine-Based Platform for Trusted Computing.Garfinkel, T., Pfaff, B., Chow, J., Rosenblum, M., Boneh, D.The design and implementation of protocol-based hidden key recoveryAggregate and verifiably encrypted signatures from bilinear mapsFinding smooth integers in short intervals using CRT decodingAttacking an obfuscated cipher by injecting faults.Almost entirely correct mixing with applications to voting.Golle, P., Zhong, S., Boneh, D., Jakobsson, M., Juels, A.On the importance of eliminating errors in cryptographic computationsOn the importance of checking cryptographic protocols for faults.On the Unpredictability of Bits of the Elliptic Curve Diffie--Hellman Scheme.A method for fast revocation of public key certificates and security capabilitiesArchitectural support for copy and tamper resistant softwareLie, D., Thekkath, C., Mitchell, M., Lincoln, P., Boneh, D., Mitchell, J., Horowitz, M.Cryptanalysis of RSA with private key d less than N-0.292Why textbook ElGamal and RSA encryption are insecure - (Extended abstract)Why Textbook ElGamal and RSA Encryption are Insecure.Generating RSA Keys on a Handheld Using an Untrusted Server.Breaking generalized Diffie-Hellman modulo a composite is no easier than factoringExperimenting with electronic commerce on the PalmPilotBreaking generalized Diffie-Hellman modulo a composite is no easier than factoring.Experimenting with electronic commerce on the PalmPilot.Cryptanalysis of RSA with private key d less than N-0.292Breaking RSA may not be equivalent to factoring (Extended abstract)An attack on RSA given a small fraction of the private key bits.Cryptanalysis of RSA with private key d less than N0.292.An attack on RSA given a small fraction of the private key bitsSWAPEROO: A simple wallet architecture for payments, exchanges, refunds, and other operationsDaswani, N., Boneh, D., Garcia-Molina, H., KETCHPEL, S., Paepcke, A.Daswani, N., Boneh, D., Gracia-Molina, H., Ketchpel, S., Paepcke, A.Generating a Product of Three Primes With an Unknown Factorization.Revocation of unread E-mail in an untrusted network.Rounding in lattices and its cryptographic applications.On the importance of checking cryptographic protocols for faults.Running dynamic programming algorithms on a DNA computer.Algorithms for black box fields and their application to cryptography.Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes.Amplification of weak learning over the uniform distribution. For example, an observer cannot predict the location tag inside a guarded data center from a few hundreds of meters away. To ensure that our tag is reproducible we make use of fuzzy extractors, a mechanism originally designed for biometric authentication. In 2011 Dr. Boneh received the Ishii award for industry education innovation. Professor Boneh received his Ph.D from Princeton University and joined Stanford in 1997. As an application, consider a location-aware disk drive that will only work inside the data center. We also analyze a mean field theoretic algorithm performing similarly to Culling on many problems. There are 100+ professionals named "Boneh", who use LinkedIn to exchange information, ideas, and opportunities. Dan Boneh (in ebraico: דן בונה ? Noisy ASP is the first problem we are aware of where a genetic-type algorithm bests all known competitors. Mail: Computer Science Dept., Gates 475, Stanford, CA, 94305-9045 ; Office: CS Building, Gates 475. Professor Boneh's research focuses on applications of cryptography to computer security. His work includes cryptosystems with novel properties, web security, security for mobile devices, and cryptanalysis. GAs fail to achieve this implicit parallelism, but we describe an algorithm we call Explicitly Parallel Search that succeeds. His work includes cryptosystems with novel properties, web security, security for mobile devices, and cryptanalysis. Danone Russia | 5,704 follower su LinkedIn | Group of companies Danone in Russia is a part of global Danone. We generalize ASP to k-ASP to study whether GAs will achieve "implicit parallelism" in a problem with many more schemata. On the territory of Russia the Group operates 18 modern plants employing over 10000 people. He is a recipient of the 2014 ACM prize and the 2013 Godel prize.