Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revisionBoth sides next revision | ||
public:research:confnotes:wistp2015 [2015-09-01 20:41] – petrs | public:research:conferences:wistp2015 [2015-09-03 13:42] – Page moved from public:research:confnotes:wistp2015 to public:research:conferences:wistp2015 mukrop | ||
---|---|---|---|
Line 13: | Line 13: | ||
* payment made via blind signatures | * payment made via blind signatures | ||
* nice attack from audience: user selects N different pseudonyms, set very low bidding price => wins bids | * nice attack from audience: user selects N different pseudonyms, set very low bidding price => wins bids | ||
- | ? can we use bitcoin for that? - can be used | + | * ? can we use bitcoin for that? - can be used |
- | ? autonomous execution without user interaction? | + | |
- | ? is report server trusted entity? - trusted to select winner and pay | + | |
Line 28: | Line 28: | ||
* dynamic quantifier - almost no correlation (doesn' | * dynamic quantifier - almost no correlation (doesn' | ||
* scalar quantifier - 60-95% success (avg 70% similarity) | * scalar quantifier - 60-95% success (avg 70% similarity) | ||
- | ? what features were extracted from webcam picture? Movement of nose. But very noisy data, better cam cam improve (but lost of attacker vector with malware-controled webcam) | + | * ? what features were extracted from webcam picture? Movement of nose. But very noisy data, better cam cam improve (but lost of attacker vector with malware-controled webcam) |
- | ? Why not use fingerprint as additional factor to authenticate? | + | |
**Paper: Neyire Deniz Sarier, Private Minutia-based Fingerprint Matching** | **Paper: Neyire Deniz Sarier, Private Minutia-based Fingerprint Matching** | ||
Line 43: | Line 43: | ||
* unified extractor and convertor into same log structure | * unified extractor and convertor into same log structure | ||
* speed 37000 events/sec (8 cores) - usable for big company | * speed 37000 events/sec (8 cores) - usable for big company | ||
- | ? implementation of compiler for regular expressions that compiles many RE together and then executed faster then every RE one-by-one. | + | * ? implementation of compiler for regular expressions that compiles many RE together and then executed faster then every RE one-by-one. |
**Paper: Konstantinos Fysarakis, Charalampos Konstantourakis, | **Paper: Konstantinos Fysarakis, Charalampos Konstantourakis, | ||
Line 111: | Line 111: | ||
* Random forest classifier | * Random forest classifier | ||
* tech report: arxiv.org/ | * tech report: arxiv.org/ | ||
- | ? bias behind rated pages? | + | * ? bias behind rated pages? |
| | ||
**Paper: Analysis of usage patterns in Ripple protocolFrederik Armknecht, Ghassan Karame, Avikarsha Mandal, Franck Youssef and Erik Zenner. " | **Paper: Analysis of usage patterns in Ripple protocolFrederik Armknecht, Ghassan Karame, Avikarsha Mandal, Franck Youssef and Erik Zenner. " | ||
Line 124: | Line 124: | ||
* a lot of artificial transaction not finished (only about 15% is real transcation) | * a lot of artificial transaction not finished (only about 15% is real transcation) | ||
* most of the current accounts are inactive (might be theoretically many accounts for single person because of privacy, but unlikely) | * most of the current accounts are inactive (might be theoretically many accounts for single person because of privacy, but unlikely) | ||
- | ? inactive accounts - not used, different from validators | + | * ? inactive accounts - not used, different from validators |
**Paper: Patrick Koeberl, Vinay Phegade, Anand Rajan, Thomas Schneider, Steffen Schulz and Maria Zhdanova. "Time to Rethink: Trust Brokerage using Trusted Execution Environments" | **Paper: Patrick Koeberl, Vinay Phegade, Anand Rajan, Thomas Schneider, Steffen Schulz and Maria Zhdanova. "Time to Rethink: Trust Brokerage using Trusted Execution Environments" |