JRE :: Java Certificate Revocation List / OCSP Performance
Dec 23, 2013
As the JRE environments and usage of applets has become more and more secure in through the evolution of enhancements to the JRE we have noticed a performance degradation in usage of these applets and launching of them.
As our customers are in the business to business environment they utilize our applets that are delivered from the server to the client. We are looking at ways to reduce the time to validate that the certificates are still valid. we are looking for ways to provide a means for our customers to validate against a CRL on our server or to cache the the checks against the OCSP so that not each and every client accessing our server needs to go out to the third party sites to get the checks completed.
Is there a means to store this information on our server and have the JRE validate against that system rather than the normal OSCP...
I have a problem with several java applications. When I start them Java wants to connect to the certificate authority, to check if the certificate is still valid and not on a blacklist.
The problem is: my whole internet is behind a password protected proxy. If I open my browser i get a windows with username and password. I enter it and internet in the browser works. But for Java it isn't working, because I see no point, where I can enter the password and username for the proxy. I can enter the proxy ip and port in the java settings, but not the password and username. So I get a error screen from java, telling me, that java could not connect. I can disable the check in the java settings, but I don't wont that.
Is there a way to tell java, that java uses my proxy with my password and username? I already googled this problem and found nothing except tutorials for connecting with proxy in the java code. But these applications are not from me, I can't change the code ...
There's a site that uses DBsign UWS to validate personal certificates on a smart card. I wound up breaking that functionality by moving the default Java truststore so I could create a new one with just root/intermediate CAs that I trust (I have no desire to allow apps signed in China, Russia, Turkey, and countries spelled with heiroglyphs). Now, my browser believes the UWS is self-signed and rfuses to run it. I need to find the certificate used to sign that app to see which cert(s) signed it, so I can add them back to the truststore. How can I find that?
When our applet loads on our HTTPS website, the JRE is rejecting the website certificate, saying it does not recognize the Certificate Authority (which is Thawte). Internet Explorer is happy with the certificate.
With tracing turned on, I can verify the JRE is checking the certificate authorities of IE, but for some reason rejects all of them. The trace shows this:
security: Certificate has failed the verification with the Internet Explorer ROOT certificates security: Invalid certificate from HTTPS server
We've tested several versions of JRE 7 and the latest version of JRE 8. All of them reject the certificate authority. This happens on various versions of Windows and Internet Explorer.
Please note that I'm not referring to the certificate used to sign the applet. The JRE is happy with that certificate.
I want to monitor performance of web application, running in java JVM(Java version 1.5.0_22) using tomcat web server, for a given functionality want to find, methods and sql queries how much time taking for execution. i am looking for setting and free tools available.
Have you ever did a design for an application with requirements such as X number of anticipated users of the application in the next 5 years, and should still perform as expected.
How do you usually implement design solution for this? the only solution I am familiar with when faced with this type of requirement is the use of EJBs (is that even a correct design for it?).
I have an application which has 10 million rows and 1000 columns in Oracle. Each value has a different set of calculations that are stored in User Defined PLSQL functions.
Data is displayed in form of data grid. When a user updates any value, the calculation is performed using plsql function and value is stored in database. Is there an easy way through which calculation is performed on the fly and i get maximum performance ?
Visual effects such as Transitions perform very poor on linux "wheezy" compared to windows. I noticed this on different PC's, checked for Java7 and Java8. If the UI contains many objects then the transition sometimes does not even appear.
I do not think this is graphic card related since videos play quite ok.
I use the default ATI driver without Xorg.conf file and installed the xcompmgr
and tried several options, such as
Option "Composite" "Enable" or Option "backingstore" "true" Option "AllowGLXWithComposite" "true"
This did not speed up things, are there other things that I could do to improve the performance ?
In our product we show search histories on the UI, means what ever user searches we make a history for that search in the database and show it on the UI.
At present we show duplicate histories also. for ex- if a user do a search with some criteria (say, abc), now if the user do search again with same criteria (abc), we show it twice on our history page.
What we need to do -
we need to remove the duplication, and only to show the search histories once if they have same criteria. also we need to save it only once in the database. means we neither display the same search histories nor store them in the database. ofcourse if we store it only once, it will be displayed only once. so we need logic in our storing part here.
Approaches we are trying -
Approach 1 - We thought to remove duplicate search histories by comparing their criteria's, but here the problem is that single search history itself can have so many criteria's and we store around 30 search histories in the database, so if we compare criteria of all of them one by one. we will loose the performance. so we dropped this approach.
Approach 2 - The second approach we are thinking is, at the time of creation of search histories, we will generate checksum based on their criteria, so if the criteria is same for two search histories the checksum generated would be same, and before creating (storing into database) the search history we first check if the checksum is already exist in the search history table for any search history or not, if it is already there, don't create the search history, as it is already there.
The problems with this approach is -
First Problem - we will need to create one more column in the Table which will impact our upgrade process, and we don't want to have an upgrade impact.
Second Problem - if user changed the sequence of criteria of search, for e.g. name criteria first and then number criteria but the values are same. and in the another search number criteria first then name criteria and values are same as first search, here the search results would be same as the criteria are same but only the sequence is different, so in this case two histories will get created (as we generate checksum based on criteria so if sequence gets changed checksum would also be different), however we want only one search history in this situation. we don't want to consider the sequence.
We store the search histories in XML format and we convert this xml to blob to store it into database, i thought to first sort them then generate checksum, but as they are in xml format, so i can't even sort them because the tags are similar to all the criteria's.
I am using infrared for monitoring performance of j2ee web application(using hibernate and spring),deploying on tomcat 7.0.23 and jdk 1.6.17.here infrared shows only http layer not sql and jsp layer.
I want a list of all running application in my java code.I got list of all the running processes by my code but I dont want that. I want only main Application. Like if two application are running in my pc then I should get only those application's Name.
I am creating a recursive method to reverse a linked list in java. It works the first time when I call it, but I want it to work where I call it a second time and it reverses it to the original state. How can I get that to work with this implementation?
public void reverseList() { System.out.printf("%-16s%-3s%n", "Name", "Score"); System.out.println("--------------- -----"); reverseList(first); } public void reverseList(Node aNode) { if (aNode != null) { reverseList(aNode.next); System.out.printf("%-15s%6s%n" , aNode.name , aNode.score); } }
One of my assignments was to make a program that would read a sequence of names and then list them all.Just to be clear, it would read them all first, and then it would list them all at the same time.
I'm making an application that will allow users to view several displays simultaneously. I'm trying to make it so that the user should be able to select one of the items from a list then hit a radio button add them to the display. And there will be a second button to remove them from the display. Oh and there will always be alteast one display.
I am creating a josephus java program with a circular linked list.This is what the methods are suppose to do
a. size(): Returns the number of items in the list.
b. isEmpty(): Returns true if the list is empty and false otherwise
c. advance(): Moves the cursor from the current position to the next item. If the cursor is at the end (tail) of this list, calling advance() should make the cursor refer to the first element in the list. If the list is empty, this operation should have no effect.
d. getCurrent(): Return the String value in the node referenced by the cursor unless the CircularLL is empty in which case write an error message to System.err.
e. add(String data): Adds a new item to the list by creating a newNode and linking it to the end of the circular linked list. The last node should point to the new node and then you should make lastNodeInserted point to new node as well.) Please note that a circular linked list is always circular. The last node should point to the beginning node. When there is only one node in a CircularLL, its next should point to itself. This method updates currNode when the first node is added, and always updates lastNodeInserted and numNodes. Take care when adding the first node this is a special case and should be handled differently.
f. remove(): If the list is empty, write an error message to System.err indicating that an attempt was made to remove from an empty queue and return null. Assuming the list is't empty, this method removes the node currently referenced by the cursor, reassigns the cursor to point to the next node in the list, and returns the String value stored in that node. To keep the list linked, you'll need to locate the previous node to the one youre removing and connect its next to the node which follows the one youre removing. Create a local Node variable (prev) to find it. Consider and handle the special case when there is only one node and youre removing it. And make sure to update lastNodeInserted whenever you remove the node that it is pointing to.
g. toString(): This should return a String representation of the circular linked list, with the first value displayed being the data of the first node added (not the data in the last node).
public class CircularLL { private class Node { String data; Node next;
public Node(String data) { this.data = data; this.next = null;
I've playing around with linked lists and methods for sorting. So far I've tested the iterative sort, insertion sort, quick sort and they all worked perfectly. Now, I am trying to implement merge sort that would take a linked list of jobs and sort them according to their priority. I found a few solutions on the web, of which I am trying to implemented this one: LeetCode.
My system is a simple one, I do have a linked list of print jobs, each of which has the priority. The following code should sort my print queue and return the link node of the first sorted element. Here's the code.
//defining a job that has priority public class Job { private int priority;
[Code]....
The problem I've been trying to solve is that I am getting the stack overflow at line
ListNode<T> h1 = mergeSort(left);
meaning that I am getting into a loop somewhere down through the process of breaking the linked list into half, half or halfs and so on.
I am following those three tutorials and I have completed it with success.
( [URL] .... ) ( [URL] .... ) ( [URL] .... )
But then, as author haven't implemented removeCountries method I tried to create it. What I did initially was to just add to class Countries this method:
public boolean removeCountry(Country country) { return countries.remove(country); }
But although compiler wasn't complaining it didn't work. Actually it worked last night (before reboot) but not today. Must be some SOAP iterator/binding thing or whatever. Or I thought that it worked but in fact it didn't.
Here are original classes:
//------------------------------- public class Country { String CountryId; String CountryName; public Country() { super();
[Code] ....
I would like to avoid my own iterator as JDeveloper can generate automatically iterators for webservices, but if I can't get it that way, what would be better way to write above mentioned iterator in removeCountry method?
Is there any way to remove object directly with something like this:
co.countries.remove(o); co.removeCountry(country)
using method
// This left unused public boolean removeCountry(Country country) { return countries.remove(country); }
I would like to know how I can get the list of installed JCA adapters from my application which deployed onto WebLogic server. Is there any WebLogic api available for that?
I have some class called sorted to sort the linked list through the nodes of the list. and other class to test this ability, i made object of the sort class called "list1" and insert the values to the linked list.
If i make other object called "list2" and want to merge those two lists by using method merge in sort class. And wrote code of
list1.merge(list2);
How can the merge method in sort class know the values of list1 that called it as this object is created in other class.
