Information security and cryptology (Sec)
Key persons
P. Laud, D. Bogdanov, A. Buldas, A. Kalu, S. Laur, H. Lipmaa, M. Niitsoo,
A.-E. Riet, V. Skachek, D. O. Theis, D. Unruh, J. Willemson
Postdocs
K. Khoshkhah, G. Tabia
Information Security
Institute of Cybernetica, Cryptography research group
of UT
Coding and information transmission
group of UT, Algorithms and theory
group of UT
Publications 2008
- A. Buldas, M. Niitsoo. Can we construct unbounded
time-stamping schemes from collision-free hash functions? In J. Baek,
F. Bao, K. Chen, X. Lai, eds., Proc. of 2nd Int. Conf. on Provable
Security, ProvSec 2008 (Shanghai, Oct./Nov. 2008), v. 5324 of
Lect. Notes in Comput. Sci., pp. 254-267. Springer, 2008. doi:
10.1007/978-3-540-88733-1_18 (WOS:
000261944500018, Scopus: 2-s2.0-57049135774)
- D. Bogdanov, S. Laur,
J. Willemson. Sharemind: a framework for fast
privacy-preserving computations. In S. Jajodia, J. Lopez, eds.,
Proc. of 13th Europ. Symp. on Research in Computer Security,
ESORICS 2008 (Málaga, Oct. 2008), v. 5283 of Lect. Notes in
Comput. Sci., pp. 192-206. Springer, 2008. doi:
10.1007/978-3-540-88313-5_13 (WOS:
000262462900013, Scopus: 2-s2.0-57049188348)
- Y. Desmedt, H. Lipmaa, D. H. Phan. Hybrid Damgård is
CCA1-secure under the DDH assumption. In M. K. Franklin, L. C.-K. Hui,
D. S. Wong, eds., Proc. of 7th Int. Conf. on Cryptology and
Network Security, CANS 2008 (Hong Kong, Dec. 2008), v. 5339 of
Lect. Notes in Comput. Sci., pp. 18-30. Springer, 2008. doi:
10.1007/978-3-540-89641-8_2 (WOS:
000264341800002, Scopus: 2-s2.0-58449129393)
- G. Di Crescenzo, H. Lipmaa. Succinct NP proofs from an
extractability assumption. In A. Beckmann, C. Dimitracopoulos,
B. Löwe, eds., Proc. of 4th Conf. on Computability in Europe
2008, CiE 2008 (Athens, June 2008), v. 5028 of Lect. Notes in
Comput. Sci., pp. 175-185. Springer, 2008. doi:
10.1007/978-3-540-69407-6_21 (WOS:
000256879500021, Scopus: 2-s2.0-45849090390)
- G. Di Crescenzo, H. Lipmaa. 3-message NP arguments in the BPK
model with optimal soundness and zero-knowledge. In S.-H. Hong,
H. Nagamochi, T. Fukunaga, eds., Proc. of 19th Int. Symp. on
Algorithms and Computation, ISAAC 2008 (Gold Coast, Dec. 2008),
v. 5369 of Lect. Notes in Comput. Sci., pp. 615-627. Springer,
2008. doi:
10.1007/978-3-540-92182-0_55 (WOS:
000264205500052, Scopus: 2-s2.0-58549105770)
- L. Haav, P. Laud. Typing computationally secure information flow
in Jif. In H. Riis Nielson, C. Probst, eds., Proc. of 13th Nordic
Wksh. on Secure IT-systems, NordSec 2008 (Oct. 2008), pp. 187-199.
2008.
- A. Jürgenson, J. Willemson. Computing exact outcomes of
multi-parameter attack trees. In R. Meersman, Z. Tari, eds.,
Proc. of OTM 2008 Confederated Int. Confs., CoopIS, DOA, GADA, IS
and ODBASE 2008 (Monterrey, Nov. 2008), Part II, v. 5332 of
Lect. Notes in Comput. Sci., pp. 1036-1051. Springer, 2008. doi:
10.1007/978-3-540-88873-4_8 (WOS:
000262465100007, Scopus: 2-s2.0-58049093119)
- J. Kivimaa, A. Ojamaa, E. Tyugu. Graded security expert
system. In Pre-Proc. of 3rd Int. Wksh. on Critical Information
Infrastructures Security, CRITIS 2008 (Rome, Oct. 2008),
pp. 333-339. AIIC, ENEA, 2008.
- P. Laud. On the computational soundness of cryptographically
masked flows. In Proc. of 35th Ann. ACM SIGPLAN-SIGACT Symp. on
Principles of Programming Languages, POPL 2008 (San Francisco, CA,
Jan. 2008), pp. 337-348. ACM Press, 2008. doi:
10.1145/1328438.1328479 (WOS:
000265876500029, Scopus: 2-s2.0-84865660260)
- P. Laud. On the computational soundness of cryptographically
masked flows. ACM SIGPLAN Notices, v. 43, n. 1, pp. 337-348,
2008. doi:
10.1145/1328897.1328479 (WOS:
000256500600032, Scopus: 2-s2.0-46449095888)
- P. Laud, L. Ngo. Threshold homomorphic encryption in the
universally composable cryptographic library. In J. Baek, F. Bao,
K. Chen, X. Lai, eds., Proc. of 2nd Int. Conf. on Provable
Security, ProvSec 2008 (Shanghai, Oct./Nov. 2008), v. 5324 of
Lect. Notes in Comput. Sci., pp. 298-312. Springer, 2008. doi:
10.1007/978-3-540-88733-1_21 (WOS:
000261944500021, Scopus: 2-s2.0-57049112123)
- S. Laur, S. Pasini. SAS-based group authentication and key
agreement protocols. In R. Cramer, ed., Proc. of 11th Int.
Wksh. on Practice and Theory in Public Key Cryptography, PKC 2008
(Barcelona, March 2008), v. 4934 of Lect. Notes in
Comput. Sci., pp. 197-213. Springer, 2008. doi:
10.1007/978-3-540-78440-1_12 (WOS:
000253709500012, Scopus: 2-s2.0-40249105903)
- H. Lipmaa. New communication-efficient oblivious transfer
protocols based on pairings. In T.-C. Wu, C.-L. Lei, V. Rijmen,
D.-T. Lee, eds., Proc. of 11th Inform. Security Conf., ISC 2008
(Taipei, Sept. 2008), v. 5222 of Lect. Notes in
Comput. Sci., pp. 441-454. Springer, 2008. doi:
10.1007/978-3-540-85886-7_30 (WOS:
000259463000030, Scopus: 2-s2.0-56649091142)
- R. Miškinis, B. Malyško, D. Smirnov, E. Urba,
A. Burokas, P. Laud, M. Oit, F. Zuliani, M. Messineo, A. Fanelli,
J. Nawrocky, P. Nogas, L. Bandzaityte, V. Simanavicius. BALTICTIME -
the demonstration of open source technologies for legal and
accountable digital time-stamping. In P. Cunningham, M. Cunningham,
eds., Collaboration and the Knowledge Economy: Issues,
Applications, Case Studies, v. 5 of Information and
Communication Technologies and the Knowledge Economy, pp. ?-?. IOS
Press, 2008.
- M. Oit. Security from the practioner's point of view. In
E. Kranakis, E. Haroutunian, E. Shahbazian, eds., Aspects of
Network and Information Security, v. 17 of NATO Science for
Peace and Security Series D: Information and Communication
Security, pp. 110-118. IOS Press, 2008. article
at IOS Press Books Online
- A. Ojamaa, E. Tyugu, J. Kivimaa. Pareto-optimal situation
analysis for selection of security measures. In Unclassified
Proc. of 2008 IEEE Military Communications Conf., MILCOM 2008:
Assuring Mission Success (San Diego, CA, Nov. 2008),
pp. 3224-3230. IEEE, 2008. doi:
10.1109/milcom.2008.4753520 (WOS:
000266709302026, Scopus: 2-s2.0-62349137332)
- J. Tamura, K. Kobara, R. Nojima, H. Imai, H. Lipmaa. A note on
the error of optimized LFC private information retrieval scheme. In
Proc. of 2008 Int. Symp. on Information Theory and Its
Applications, ISITA 2008 (Auckland, Dec. 2008), 4 pp. IEEE CS
Press, 2008. doi:
10.1109/isita.2008.4895556 (WOS:
000273504800184, Scopus: 2-s2.0-77951119251)
- I. Tšahhirov, P. Laud. Application of
dependency graphs to security protocol analysis. In G. Barthe,
C. Fournet, eds., Revised Selected Papers from 3rd Conf. on Global
Computing, TGC 2007 (Sophia Antipolis, Nov. 2007), v. 4912
of Lect. Notes in Comput. Sci., pp. 294-311. Springer, 2008.
doi:
10.1007/978-3-540-78663-4_20 (WOS:
000254511800018, Scopus: 2-s2.0-41549155487)
- J. Willemson, A. Ansper. A secure and scalable
infrastructure for inter-organizational data exchange and egovernment
application. In Proc. of 3rd Int. Conf. on Availability,
Reliability and Security, ARES 2008 (Barcelona, March 2008),
pp. 572-577. IEEE CS Press, 2008. doi:
10.1109/ares.2008.90 (WOS:
000256665200081, Scopus: 2-s2.0-49049105738)
Publications 2009
- A. Ansper, S. Heiberg, H. Lipmaa,
T. A. Øverland, F. van Laenen. Security and trust for the Norwegian
e-voting pilot project
E-valg 2011. In A. Jøsang, T. Maseng, S. J. Knapskog, eds.,
Proc. of 14th Nordic Conf. on Secure IT Systems, NordSec 2009
(Oslo, Oct. 2009), v. 5838 of Lect. Notes in Comput. Sci.,
pp. 207-222. Springer, 2009. doi:
10.1007/978-3-642-04766-4_15 (WOS:
000273517300015, Scopus: 2-s2.0-78049401680)
- D. Bogdanov, M. V. Crispino, V. Cyras, K. Glass, K. Lapin,
M. Panebarco, G. M. Todesco, F. Zuliani. VirtualLife virtual world
platform: peer-to-peer, security and rule of law. In Proc. of 2009
NEM Summit (St Malo, Sept. 2009), pp. 124-129. Eurescom,
2009.
- A. Buldas, A. Jürgenson,
M. Niitsoo. Efficiency bounds for adversary constructions in
black-box reductions. In C. Boyd, J. González Nieto, eds., Proc. of
14th Australasian Conf. on Information Security and Privacy, ACISP
2009 (Brisbane, July 2009), v. 5594 of Lect. Notes in
Comput. Sci., pp. 264-275. Springer, 2009. doi:
10.1007/978-3-642-02620-1_19 (WOS:
000268100500019, Scopus: 2-s2.0-70350625447)
- A. Buldas, S. Laur, M. Niitsoo. Oracle
separation in the non-uniform model. In J. P. Pieprzyk, F. Zhang,
eds., Proc. of 3rd Int. Conf. on Provable Security, ProvSec 2009
(Guangzhou, Nov. 2009), v. 5848 of Lect. Notes in
Comput. Sci., pp. 230-244. Springer, 2009. doi:
10.1007/978-3-642-04642-1_19 (WOS:
000279343700017, Scopus: 2-s2.0-78650708751)
- J. Kivimaa, A. Ojamaa, E. Tyugu. Graded security
expert system. In R. Setola, S. Geretshuber, eds., Revised Papers
from 3rd Int. Wksh. on Critical Information Infrastructures Security,
CRITIS 2008 (Rome, Oct. 2008), v. 5508 of Lect. Notes in
Comput. Sci., pp. 279-286. Springer, 2009. doi:
10.1007/978-3-642-03552-4_25 (WOS:
000273604000025, Scopus: 2-s2.0-70349322766)
- J. Kivimaa, A. Ojamaa, E. Tyugu. Managing evolving
security situations. In Unclassified Proc. of 2009 IEEE Military
Communications Conf., MILCOM 2009 (Boston, MA, Oct. 2009), 7
pp. IEEE, 2009. doi:
10.1109/milcom.2009.5380110 (WOS:
000280509900090, Scopus: 2-s2.0-77951483235)
- P. Laud, M. Roos. Formal analysis of the Estonian
Mobile-ID protocol. In A. Jøsang, T. Maseng, S. J. Knapskog, eds.,
Proc. of 14th Nordic Conf. on Secure IT Systems, NordSec 2009
(Oslo, Oct. 2009), v. 5838 of Lect. Notes in Comput. Sci.,
pp. 271-286. Springer, 2009. doi:
10.1007/978-3-642-04766-4_19 (WOS:
000273517300019, Scopus: 2-s2.0-78650744528)
- P. Laud, I. Tšahhirov. A user interface for a
game-based protocol verification tool. In P. Degano, J. Guttman, eds.,
Pre-Proc. of 6th Int. Wksh. on Formal Aspects in Security and Trust,
FAST 2009 (Eindhoven, Nov. 2009), to appear.
- S. Laur, S. Pasini. User-aided data authentication.
Int. J. of Security and Networks, v. 4, n. 1-2, pp. 69-86,
2009. doi:
10.1504/ijsn.2009.023427
- R. Miškinis, D. Smirnov, E. Urba, A. Burokas,
B. Malyško, P. Laud, F. Zuliani. Digital time stamping system
based on open source technologies. In Proc. of 2009 IEEE
Int. Frequency Control Symp., joint with 22nd Europ. Frequency and
Time Forum (Besançon, Apr. 2009), pp. 700-705. IEEE,
2009. doi:
10.1109/freq.2009.5168274 (WOS:
000274814900144, Scopus: 2-s2.0-70449492928)
- J. Nakahara Jr., P. Sepehrdad, B. Zhang, M. Wang. Linear (hull)
and algebraic cryptanalysis of the block cipher PRESENT. In
J. A. Garay, A. Miyaji, A. Otsuka, eds.,
Proc. of 8th Int. Conf. on Cryptology and Network Security,
CANS 2009 (Kanazawa, Dec. 2009), v. 5888 of Lect. Notes in
Comput. Sci., pp. 58-75. Springer, 2009. doi:
10.1007/978-3-642-10433-6_5 (WOS:
000280395000005, Scopus: 2-s2.0-71649115694)
Publications 2010
- G. V. Bard, N. Courtois, J. Nakahara, P. Sepehrdad,
B. Zhang. Algebraic, AIDA/Cube and side channel analysis of KATAN
family of block ciphers. In G. Gong, K. C. Gupta, eds., Proc. of
11th Int. Conf. on Cryptology in India, INDOCRYPT 2010 (Hyderabad,
Dec. 2010), v. 6498 of Lect. Notes in Comput. Sci.,
pp. 176-196. Springer, 2010. doi:
10.1007/978-3-642-17401-8_14 (WOS:
000293683800014, Scopus: 2-s2.0-78651099838)
- D. Bogdanov, I. Livenson. VirtualLife: secure identity management
in peer-to-peer systems. In P. Daras, O. Mayora Ibarra, eds.,
Proc. of 1st Int. ICST Conf. on User Centric Media,
UCMedia 2009 (Venice, Dec. 2009), v. 40 of Lect. Notes of
ICST, pp. 181-188. Springer, 2010. doi:
10.1007/978-3-642-12630-7_21 (Scopus:
84885886852)
- A. Buldas, M. Niitsoo. Optimally tight security proofs for
hash-then-publish time-stamping. In R. Steinfeld, P. Hawkes, eds.,
Proc. of 15th Australasian Conf. on Information Security and
Privacy, ACISP 2010 (Sydney, July 2010), v. 6168 of
Lect. Notes in Comput. Sci., pp. 318-335. Springer, 2010. doi:
10.1007/978-3-642-14081-5_20 (WOS:
000284032000020, Scopus: 2-s2.0-78649890613)
- R. Chaabouni, H. Lipmaa, A. Shelat. Additive
combinatorics and discrete logarithm based range protocols. In R.
Steinfeld, P. Hawkes, eds., Proc. of 15th Australasian Conf. on
Information Security and Privacy, ACISP 2010 (Sydney, July 2010),
v. 6168 of Lect. Notes in Comput. Sci., pp. 336-351. Springer,
2010. doi:
10.1007/978-3-642-14081-5_21 (WOS:
000284032000021, Scopus: 2-s2.0-78649879348)
- M. González Muñiz, R. Steinwandt. Cryptanalysis of a message
recognition protocol by Mashatan and Stinson. In D. Lee, S. Hong,
eds., Revised Selected Papers from 12th Int. Conf. on Information
Security and Cryptology, ICISC 2009 (Seoul, Dec. 2009), v. 5984 of
Lect. Notes in Comput. Sci., pp. 362-373. Springer, 2010. doi:
10.1007/978-3-642-14423-3_24 (WOS:
000282835500024, Scopus: 2-s2.0-77954588703)
- M. González Muñiz, R. Steinwandt. Security of signature schemes
in the presence of key-dependent messages. Tatra Mountains
Math. Publications, v. 47, pp. 15-29, 2010. article on
journal's webpage (WOS:
000314316900002)
- J. Groth, A. Kiayias, H. Lipmaa. Multi-query
computationally-private information retrieval with constant
communication rate. In P. Q. Nguyen, D. Pointcheval, eds.,
Proc. of 13th Int. Conf. on Practice and Theory in Public Key
Cryptography, PKC 2010 (Paris, May 2010), v. 6056 of
Lect. Notes in Comput. Sci., pp. 107-123. Springer, 2010. doi:
10.1007/978-3-642-13013-7_7 (WOS:
000279498800007, Scopus: 2-s2.0-79955529260)
- S. Heiberg. Internet voting - the Estonian experience. In
V. Matyás, Z. Ríha, eds., Proc. of 11th Int. Conf. on Information
Security, Information Security Summit, IS2 2010 (Praha, March
2010), pp. 133-138. Tate International s.r.o., Praha, 2010.
- S. Heiberg, H. Lipmaa, F. van Laenen. On e-vote
integrity in the case of malicious voter computers. In D. Gritzalis,
B. Preneel, M. Theoharidou, eds., Proc. of 15th Europ. Symp. on
Research in Computer Security, ESORICS 2010 (Athens, Sept. 2010),
v. 6345 of Lect. Notes in Comput. Sci., pp. 373-388. Springer,
2010. doi:
10.1007/978-3-642-15497-3_23 (WOS:
000286151000023, Scopus: 2-s2.0-78049372809)
- A. Jürgenson, J. Willemson, On fast and approximate
attack tree computations. In J. Kwak, R. H. Deng, G. Wang, Y. Won,
eds., Proc. of 6th Int. Conf. on Security, Practice and Experience
Conf., ISPEC 2010 (Seoul, May 2010), v. 6047 of
Lect. Notes in Comput. Sci., pp. 56-66. Springer, 2010. doi:
10.1007/978-3-642-12827-1_5 (WOS:
000279047800005, Scopus: 2-s2.0-78650277597)
- A. Jürgenson, J. Willemson. Serial model for attack tree
computations. In D. Lee, S. Hong, eds., Revised Selected Papers
from 12th Int. Conf. on Information Security and Cryptology, ICISC
2009 (Seoul, Dec. 2009), v. 5984 of
Lect. Notes in Comput. Sci., pp. 118-128. Springer, 201. doi:
10.1007/978-3-642-14423-3_9 (WOS:
000282835500009, Scopus: 2-s2.0-77954603264)
- G. Klein, A. Ojamaa, P. Grigorenko, M. Jahnke,
E. Tyugu. Enhancing response selection in impact estimation
approaches. In M. Amanowicz, P. Antweiler, P. Lenk, A. Najgebauer,
eds., Concepts and Implementations for Innovative Military
Communications and Information Technologies, pp. 277-286. Military Univ. of Techn., Warsaw,
2010.
- P. Laud, I. Tšahhirov. A user interface for a
game-based protocol verification tool. In P. Degano, J. Guttman, eds.,
Revised Selected Papers from 6th Int. Wksh. on Formal Aspects in
Security and Trust, FAST 2009 (Eindhoven, Nov. 2009), v. 5983 of
Lect. Notes in Comput. Sci., pp. 263-278. Springer, 2010. doi:
10.1007/978-3-642-12459-4_19 (WOS:
000279740300019, Scopus: 2-s2.0-77953257824)
- S. Laur, H. Lipmaa. On the feasibility of consistent
computations. In P. Q. Nguyen, D. Pointcheval, eds.,
Proc. of 13th Int. Conf. on Practice and Theory in Public Key
Cryptography, PKC 2010 (Paris, May 2010), v. 6056 of
Lect. Notes in Comput. Sci., pp. 88-106. Springer, 2010. doi:
10.1007/978-3-642-13013-7_6 (WOS:
000279498800006, Scopus: 2-s2.0-79955542335)
- H. Lipmaa. First CPIR protocol with data-dependent
computation. In D. Lee, S. Hong., eds., Revised Selected Papers
from 12th Int. Conf. on Information Security and Cryptology, ICISC
2009 (Seoul, Dec. 2009), v. 5984 of
Lect. Notes in Comput. Sci., pp. 193-210. Springer, 2010. doi:
10.1007/978-3-642-14423-3_14 (WOS:
000282835500014, Scopus: 2-s2.0-77954567837)
- H. Lipmaa, B. Zhang. Efficient generalized selective
private function evaluation with applications in biometric
authentication. In F. Bao, M. Yung, D. Lin, J. Jing, eds., Revised
Selected Papers from 5th China Int. Conf. on Information Security and
Cryptology, INSCRYPT 2009 (Beijing, Dec. 2009), v. 6151
Lect. Notes in Comput. Sci., pp. 154-163. Springer, 2010. doi:
10.1007/978-3-642-16342-5_12 (WOS:
000286442600012, Scopus: 2-s2.0-78650181766)
- H. Lipmaa, B. Zhang. Two new efficient PIR-writing
protocols. In J. Zhou, M. Yung, eds., Proc. of 8th Int. Conf. on
Applied Cryptography and Network Security, ACNS 2010 (Beijing, June
2010), v. 6123 of Lect. Notes in Comput. Sci.,
pp. 438-455. Springer, 2010. doi:
10.1007/978-3-642-13708-2_26 (WOS:
000280420300026, Scopus: 2-s2.0-79956321319)
- R. Miškinis, D. Smirnov, E. Urba, A. Burokas,
B. Malyško, P. Laud, F. Zuliani. Digital time stamping
system based on open source technologies. In IEEE Trans. on
Ultrasonics, Ferroelectrics and Frequency Control, v. 57, n. 3,
pp. 721-727, 2010. doi:
10.1109/tuffc.2010.1470 (WOS:
000275322400031, Scopus: 2-s2.0-77949398755)
- M. Niitsoo. Optimal adversary behavior for the serial model of
financial attack trees. In I. Echizen, N. Kunihiro, R. Sasaki, eds.,
Proc. of 5th Int. Wksh. on Security, IWSEC 2010 (Kobe,
Nov. 2010), v. 6434 of Lect. Notes in Comput. Sci.,
pp. 354-370. Springer, 2010. doi:
10.1007/978-3-642-16825-3_24 (WOS:
000290643900024, Scopus: 2-s2.0-78650007008)
- J. Tepandi, S. Vassiljev, I. Tšahhirov. Wireless PKI
security and mobile voting. Computer, v. 43, n. 6, pp. 54-60,
2010. doi:
10.1109/mc.2009.418 (WOS:
000278621000011, Scopus: 2-s2.0-77953337866)
- J. Willemson. Extending the Gordon-Loeb model for information
security investment. In Proc. of 5th Int. Conf. on Availability,
Reliability and Security, ARES 2010 (Kraków, Feb. 2010),
pp. 258-261. IEEE, 2010. doi:
10.1109/ares.2010.37 (WOS:
000278197800036, 000283706400036, Scopus: 2-s2.0-77952361132)
Publications 2011
- G. Alberghs, P. Grigorenko, J. Kivimaa. Quantitative system
reliability approach for optimizing IT security costs in an AI
environment. In J. Penjam, ed., Proc. of 12th Symp. on Programming
Languages and Software Tools, SPLST 2011 (Tallinn, Oct. 2011),
pp. 219-230. Inst. of Cybern., 2011. (WOS:
000328999800021, Scopus: 2-s2.0-84869795458)
- C. Czosseck, E. Tyugu, T. Wingfield, eds. Proc. of 3rd
Int. Conf. on Cyber Conflict, ICCC 2011 (Tallinn, June 2011),
xvii+185 pp. CCD COE Publications, 2011. book
in IEEE Xplore (Scopus:
2-s2.0-80051981561)
- S. Garg, V. Rao, A. Sahai, D. Schröder, D. Unruh. Round
optimal blind signatures. In P. Rogaway, ed., Proc. of 31st
Int. Cryptology Conf., CRYPTO 2011 (Santa Barbara, CA,
Aug. 2011), v. 6841 of Lect. Notes in Comput. Sci.,
pp. 630-648. Springer, 2011. doi:
10.1007/978-3-642-22792-9_36 (Scopus:
2-s2.0-80052020660)
- M. González Muñiz, P. Laud. On the (im)possibility
of perennial message recognition protocols without public-key
cryptography. In Proc. of 26th Ann. ACM Symp. on Applied Computing,
SAC '11 (TaiChung, March 2011), pp. 1510-1515. ACM Press,
2011. doi:
10.1145/1982185.1982508 (Scopus:
2-s2.0-79959299654)
- S. Heiberg, P. Laud, S. Másson, C. P. Larsen. Secure
mobile access to homecare patients' data. In Proc. 5th
Int. Conf. on Theory and Practice of Electronic Governance,
ICEGOV 2011 (Tallinn, Sept. 2011), ACM
Int. Conf. Proc. Series, pp. 363-364. ACM Press, 2011. doi:
10.1145/2072069.2072143 (Scopus:
2-s2.0-84855413048)
- P. Laud. Implementing cryptographic primitives in the symbolic
model. In M. Bobaru, K. Havelund, G. J. Holzmann, R. Joshi, eds.,
Proc. of 3rd NASA Formal Methods Symp., NFM 2011 (Pasadena,
CA, Apr. 2011), v. 6617 of Lect. Notes in Comput. Sci.,
pp. 267-281. Springer, 2011. doi:
10.1007/978-3-642-20398-5_20 (WOS:
000301947700020, Scopus: 2-s2.0-79955001673)
- S. Laur, J. Willemson, B. Zhang.
Round-efficient oblivious database manipulation. In X. Lai, J. Zhou,
H. Li, eds., Proc. of 14th Int. Information Security Conf.,
ISC 2011 (Xi'an, Oct. 2011), v. 7001 of Lect. Notes in
Comput. Sci., pp. 262-277. Springer, 2011. doi:
10.1007/978-3-642-24861-0_18 (WOS:
000306719400018, Scopus: 2-s2.0-80054827514)
- H. Lipmaa. On the CCA1-security of Elgamal and
Damgård's Elgamal. In X. Lai, M. Yung, eds., Revised Papers
from 6th China Int. Conf. on Information Security and Cryptology,
INSCRYPT 2010 (Shanghai, Oct. 2010), v. 6584 of
Lect. Notes in Comput. Sci., pp. 18-35. Springer, 2011. doi:
10.1007/978-3-642-21518-6_2 (WOS:
000307265600002, Scopus: 2-s2.0-79960779355)
- E. Tyugu. Artificial intelligence in cyber defense. In
C. Czosseck, E. Tyugu, T. Wingfield, eds. Proc. of 3rd
Int. Conf. on Cyber Conflict, ICCC 2011 (Tallinn, June 2011),
pp. 95-105. CCD COE Publications, 2011. article
in IEEE Xplore (Scopus:
2-s2.0-80051974546)
- D. Unruh. Concurrent composition in the bounded quantum
storage model. In K. G. Paterson, ed., Proc. of 30th
Ann. Int. Conf. on the Theory and Applications of Cryptographic
Techniques, EUROCRYPT 2011 (Tallinn, May 2011), v. 6632 of
Lect. Notes in Comput. Sci., pp. 467-486. Springer, 2011. doi:
10.1007/978-3-642-20465-4_26 (WOS:
000301949500026, Scopus: 2-s2.0-79957973037)
- D. Unruh. Termination-insensitive computational
indistinguishability (and applications to computational soundness). In
Proc. of 24th IEEE Computer Security Foundations Symp.,
CSF 2011 (Vaux de Cernay, June 2011), pp. 251-265. IEEE CS
Press, 2011. doi:
10.1109/csf.2011.24 (WOS:
000300766400017, Scopus: 2-s2.0-80052654166)
- J. Willemson. Pseudonymization service for X-road
e-government data exchange layer. In K. N. Andersen, E. Francesconi,
Å. Grönlund, T. M. van Engers, eds., Proc. of 2nd
Int. Conf. on Electronic Government and the Information Systems
Perspective, EGOVIS 2011 (Toulouse, Aug./Sept. 2011), v. 6866
of Lect. Notes in Comput. Sci., pp. 135-145. Springer, 2011. doi:
10.1007/978-3-642-22961-9_11 (Scopus:
2-s2.0-80052385435)
- B. Zhang. Generic constant-round oblivious sorting
algorithm for MPC. In J. Groth, X. Boyen, X. Chen, eds., Proc. of
5th Int. Conf. on Provable Security, ProvSec 2011 (Xi'an,
Oct. 2011), v. 6980 of Lect. Notes in Comput. Sci.,
pp. 240-256. Springer, 2011. doi:
10.1007/978-3-642-24316-5_17 (WOS:
000306343500017, Scopus: 2-s2.0-80053158432)
- B. Zhang. Simulatable adaptive oblivious transfer with
statistical receiver's privacy. In J. Groth, X. Boyen, X. Chen, eds.,
Proc. of 5th Int. Conf. on Provable Security, ProvSec 2011
(Xi'an, Oct. 2011), v. 6980 of
Lect. Notes in Comput. Sci., pp. 52-67. Springer, 2011. doi:
10.1007/978-3-642-24316-5_6 (WOS:
000306343500006, Scopus: 2-s2.0-80053167743)
Publications 2012
- A. S. Ahmed, P. Laud. Formal security analysis of OpenID
with GBA protocol. In R. Prasad, K. Farkas, A. U. Schmidt, A. Lioy,
G. Russello, F. Luccio, eds.,
Proc. of 3rd Int. ICST Conf. on Security and Privacy in Mobile
Information and Communication Systems, Mobisec 2011 (Aalborg, May
2011), v. 94 of Lect. Notes of ICST, pp. 113-124. Springer,
2012. doi:
10.1007/978-3-642-30244-2_10 (Scopus:
2-s2.0-84869594756)
- A. Ansper. Designing a governmental backbone. In P. Laud,
ed., Revised Selected Papers from 16th Nordic Conf. on Secure IT
Systems, NordSec 2011 (Tallinn, Oct. 2011), v. 7161 of
Lect. Notes in Comput. Sci., pp. 1-3. Springer, 2012. doi:
10.1007/978-3-642-29615-4_1 (Scopus:
2-s2.0-84862142324)
- M. Backes, A. Malik, D. Unruh. Computational soundness
without protocol restrictions. In Proc. of 19th ACM Conf. on
Computer and Communications Security, CCS 2012 (Raleigh, NC,
Oct. 2012), pp. 699-711. ACM Press, 2012. doi:
10.1145/2382196.2382270 (Scopus:
2-s2.0-84869388564)
- D. Bogdanov, R. Jagomägis, S. Laur. A
universal toolkit for cryptographically secure privacy-preserving data
mining. In M. Chau, G. A. Wang, W. T. Yue, H. Chen, eds., Proc. of
Pacific Asia Workshop on Intelligence and Security Informatics,
PAISI 2012 (Kuala Lumpur, May 2012), v. 7299 of
Lect. Notes in Comput. Sci., pp. 112-126. Springer, 2012. doi:
10.1007/978-3-642-30428-6_9 (Scopus:
2-s2.0-84862196355)
- D. Bogdanov, M. Niitsoo, T. Toft,
J. Willemson. High-performance secure multi-party computation
for data mining applications. Int. J. of Information Security,
v. 11, n. 6, pp. 403-418, 2012. doi:
10.1007/s10207-012-0177-2 (WOS:
000313726000003, Scopus: 2-s2.0-84867711104)
- D. Bogdanov, R. Talviste, J.
Willemson. Deploying secure multi-party computation for financial
data analysis. In A. D. Keromytis, ed., Revised Selected Papers
from 16th Int. Conf. on Financial Cryptography, FC 2012
(Kralendijk, Bonaire, Feb./March 2012), v. 7397 of Lect. Notes
in Comput. Sci., pp. 57-64. Springer, 2012. doi:
10.1007/978-3-642-32946-3_5 (Scopus:
2-s2.0-84865816316)
- A. Buldas, R. Stepanenko. Upper bounds for adversaries'
utility in attack trees. In J. Grossklags, J. Walrand, eds,
Proc. of 3rd Int. Conf. on Decision and Game Theory for Security,
GameSec 2012 (Budapest, Nov. 2012), v. 7638 of
Lect. Notes in Comput. Sci., pp. 98-117. Springer, 2012. doi:
10.1007/978-3-642-34266-0_6 (Scopus:
2-s2.0-84869414532)
- R. Chaabouni, H. Lipmaa, B. Zhang. A
non-interactive range proof with constant communication. In
A. D. Keromytis, ed.,
Revised Selected Papers from 16th Int. Conf. on Financial
Cryptography, FC 2012 (Kralendijk, Bonaire, Feb./March 2012),
v. 7397 of Lect. Notes in Comput. Sci., pp. 179-199. Springer,
2012. doi:
10.1007/978-3-642-32946-3_14 (Scopus:
2-s2.0-84865811347)
- M. González Muñiz, R. Steinwandt. Security of message
authentication codes in the presence of key-dependent
messages. Design, Codes and Cryptography, v. 64, n. 1-2,
pp. 161-169, 2012. doi:
10.1007/s10623-011-9523-z (WOS:
000303512700013, Scopus: 2-s2.0-84860327782)
- S. Heiberg, P. Laud, J. Willemson. The
application of i-voting for Estonian parliamentary elections of
2011. In A. Kiayias, H. Lipmaa, eds., Revised Selected Papers from
3rd Int. Conf. on e-Voting and Identity, VoteID 2011 (Tallinn,
Sept. 2011), v. 7187 of Lect. Notes in Comput. Sci.,
pp. 208-223. Springer, 2012. doi:
10.1007/978-3-642-32747-6_13 (Scopus:
2-s2.0-84867440391)
- A. Kiayias, H. Lipmaa, eds. Revised Selected Papers from
3rd Int. Conf. on e-Voting and Identity, VoteID 2011 (Tallinn,
Sept. 2011), v. 7187 of Lect. Notes in Comput. Sci., x+257
pp. Springer, 2012. doi:
10.1007/978-3-642-32747-6 (Scopus:
2-s2.0-84867448347)
- P. Laud. Secure implementation of asynchronous method calls
and futures. In C. Mitchell, A. Tomlinson, eds., Proc. of 4th
Int. Conf. on Trusted Systems, InTrust 2012 (London,
Dec. 2012), v. 7711 of Lect. Notes in Comput. Sci.,
pp. 25-47. Springer, 2012. doi:
10.1007/978-3-642-35371-0_3 (Scopus:
2-s2.0-84872230213)
- P. Laud, ed. Revised Selected Papers from 16th Nordic
Conf. on Secure IT Systems, NordSec 2011 (Tallinn,
Oct. 2011), v. 7161 of Lect. Notes in Comput. Sci., x+273
pp. Springer, 2012. doi:
10.1007/978-3-642-29615-4 (Scopus:
2-s2.0-84862147262)
- H. Lipmaa. Progression-free sets and sublinear
pairing-based non-interactive zero-knowledge arguments. In R. Cramer,
ed., Proc. of 9th Theory of Cryptography Conf., TCC 2012
(Taormina, March 2012), v. 7194 of Lect. Notes in
Comput. Sci., pp. 169-189. Springer, 2012. doi:
10.1007/978-3-642-28914-9_10 (Scopus:
2-s2.0-84858312040)
- H. Lipmaa. Secure accumulators from Euclidean rings without
trusted setup. In F. Bao, P. Samarati, J. Zhou, eds., Proc. of 10th
Int. Conf. on Applied Cryptography and Network Security,
ACNS 2012 (Singapore, June 2012), v. 7341 of Lect. Notes
in Comput. Sci., pp. 224-240. Springer, 2012. doi:
10.1007/978-3-642-31284-7_14 (Scopus:
2-s2.0-84863468185)
- H. Lipmaa, B. Zhang. A more efficient
computationally sound non-interactive zero-knowledge shuffle
argument. In I. Visconti, R. De Prisco, eds., Proc. of 8th Conf. on
Security and Cryptography for Networks, SCN 2012 (Amalfi,
Sept. 2012), v. 7485 of
Lect. Notes in Comput. Sci., pp. 477-502. Springer, 2012. doi:
10.1007/978-3-642-32928-9_27 (Scopus:
2-s2.0-84866636210)
- M. Niitsoo. Deterministic random oracles. In T. Takagi,
G. Wang, Z. Qin, S. Jiang, Y. Yu, eds., Proc. of 6th Int. Conf. on
Provable Security, ProvSec 2012 (Chengdu, Sept. 2012), v. 7496 of
Lect. Notes in Comput. Sci., pp. 88-103. Springer, 2012. doi:
10.1007/978-3-642-33272-2_7 (Scopus:
2-s2.0-84866017946)
- A. Ojamaa, K. Düüna. Assessing the security of Node.js
platform. In Proc. of 2012 Conf. on Internet Technology and Secured
Transactions, ICITST '12 (London, Dec. 2012),
pp. 348-355. IEEE, 2012. article
in IEEE Xplore (WOS:
000317120000055, Scopus: 2-s2.0-84876162074)
- A. Ojamaa, K. Düüna. Security assessment of Node.js
platform. In V. Venkatakrishnan, D. Goswami, eds., Proc. of 8th
Int. Conf. on Information Systems Security, ICISS 2012 (Guwahati,
Dec. 2012), v. 7671 of Lect. Notes in Comput. Sci.,
pp. 35-43. Springer, 2012. doi:
10.1007/978-3-642-35130-3_3 (Scopus:
2-s2.0-84871538249)
- A. Pankova, P. Laud. Symbolic analysis of
cryptographic protocols containing bilinear pairings. In Proc. of
25th IEEE Computer Security Foundations Symp., CSF '12
(Cambridge, MA, June 2012), pp. 63-77. IEEE CS Press, 2012. doi:
10.1109/csf.2012.10 (WOS:
000309007800005, Scopus: 2-s2.0-84866948237)
- M. Pettai, P. Laud. Securing the future - an
information flow analysis of a distributed OO language. In
M. Bieliková, G. Friedrich, G. Gottlob, S. Katzenbeisser, G. Turán,
eds., Proc. of 38th Int. Conf. on Current Trends in Theory and
Practice of Computer Science, SOFSEM 2012 (Špindleruv
Mlýn, Jan. 2012), v. 7147 of Lect. Notes in Comput. Sci.,
pp. 576-587. Springer, 2012. doi:
10.1007/978-3-642-27660-6_47 (WOS:
000307258500047, Scopus: 2-s2.0-84856060986)
- D. Schröder, D. Unruh. Security of blind signature
revisited. In M. Fischlin, J. Buchmann, M. Manulis, eds., Proc. of
15th Int. Conf. on Practice and Theory in Public-Key Cryptography,
PKC 2012 (Darmstadt, May 2012), v. 7293 of Lect. Notes in
Comput. Sci., pp. 662-679. Springer, 2012. doi:
10.1007/978-3-642-30057-8_39 (Scopus:
2-s2.0-84861710732)
- E. Tyugu. Command and control of cyber weapons. In
C. Czosseck, R. Ottis, K. Ziolkowski, eds., Proc. of 4th
Int. Conf. on Cyber Conflict, CyCon 2012 (Tallinn, June
2012), pp. 95-105. CCD COE Publications, 2012. article
in IEEE Xplore (Scopus:
2-s2.0-84866607478)
- D. Unruh. Quantum proofs of knowledge. In D. Pointcheval,
T. Johansson, eds., Proc. of 31st Ann. Int. Conf. on the Theory and
Applications of Cryptographic Techniques, EUROCRYPT 2012
(Cambridge, Apr. 2012), v. 7237 of
Lect. Notes in Comput. Sci., pp. 135-152. Springer, 2012. doi:
10.1007/978-3-642-29011-4_10 (Scopus:
2-s2.0-84859959109)
Publications 2013
- A. Ansper, A. Buldas, M. Freudenthal,
J. Willemson. High-performance qualified digital signatures for
X-Road. In H. Riis Nielson, D. Gollmann, eds., Proc. of 18th Nordic
Conf. on Secure IT Systems, NordSec 2013 (Ilulissat,
Oct. 2013), v. 8208 of Lect. Notes in Comput. Sci.,
Springer, pp. 123-138. Springer, 2013. doi:
10.1007/978-3-642-41488-6_9 (WOS:
000340414300009, Scopus: 2-s2.0-84890885664)
- A. Ansper, A. Buldas, M. Freudenthal,
J. Willemson. Protecting a federated database infrastructure
against denial-of-service attacks. In E. Luiijf, P. Hartel, eds.,
Revised Selected Papers from 8th Int. Conf. on Critical Information
Infrastructures Security, CRITIS 2013 (Amsterdam,
Sept. 2013), v. 8328 of
Lect. Notes in Comput. Sci., pp. 26-37. Springer, 2013. doi:
10.1007/978-3-319-03964-0_3 (Scopus:
2-s2.0-84893168380)
- M. Backes, F. Bendun, D. Unruh. Computational soundness of
symbolic zero-knowledge proofs: weaker assumptions and mechanized
verification. In D. Basin, J. C. Mitchell, eds., Proc. of 2nd
Int. Conf. on Principles of Security and Trust, POST 2013 (Rome,
March 2013), v. 7796 of Lect. Notes in Comput. Sci.,
pp. 206-225. Springer, 2013. doi:
10.1007/978-3-642-36285-9_63 (Scopus:
2-s2.0-84874412469)
- D. Bogdanov, A. Kalu. Pushing back the rain - how to
create trustworthy services in the cloud. ISACA J., v. 2013/3,
pp. 49-51, 2013. article
on publisher's website (Scopus:
2-s2.0-84878402955)
- D. Bogdanov, P. Laud, J. Randmets.
Domain-polymorphic language for privacy-preserving applications. In
Proc. of 1st ACM Wksh. on Language Support for Privacy Enhancing
Technologies, PETShop '13 (Berlin, Nov. 2013), pp. 23-25. ACM
Press, 2013. doi:
10.1145/2517872.2517875 (Scopus:
2-s2.0-84889024731)
- F. Böhl, D. Unruh. Symbolic universal composability. In
Proc. of 26th IEEE Computer Security Foundations Symp.,
CSF '13 (Tulane, LA, June 2013), pp. 257-271. IEEE CS Press,
2013. doi:
10.1109/csf.2013.24 (WOS:
000335225600017, Scopus: 2-s2.0-84885010966)
- A. Buldas, A. Kroonmaa, R. Laanoja. Keyless
signatures' infrastructure: how to build global distributed
hash-trees. In H. Riis Nielson, D. Gollmann, eds.,
Proc. of 18th Nordic Conf. on Secure IT Systems, NordSec 2013
(Ilulissat, Oct. 2013), v. 8208 of Lect. Notes in
Comput. Sci., pp. 313-320. Springer, 2013. doi:
10.1007/978-3-642-41488-6_21 (WOS:
000340414300021, Scopus: 2-s2.0-84890876403)
- A. Buldas, R. Laanoja. Security proofs for hash tree
time-stamping using hash functions with small output size. In C. Boyd,
L. Simpson, eds., Proc. of 18th Australasian Conf. on Information
Security and Privacy, ACISP 2013 (Brisbane, July 2013),
v. 7959 of Lect. Notes in Comput. Sci., pp. 235-250. Springer,
2013. doi:
10.1007/978-3-642-39059-3_16 (Scopus:
2-s2.0-84884481046)
- A. Buldas, A. Lenin. New efficient utility upper
bounds for the fully adaptive model of attack trees. In S. K. Das,
C. Nita-Rotaru, M. Kantarcioglu, eds., Proc. of 4th Int. Conf. on
Decision and Game Theory for Security, GameSec 2013 (Fort Worth, TX,
Nov. 2013), v. 8252 of Lect. Notes in Comput. Sci.,
pp. 192-205. Springer, 2013. doi:
10.1007/978-3-319-02786-9_12 (Scopus:
2-s2.0-84893415855)
- A. Buldas, M. Niitsoo. Black-box separations and
their adaptability to the non-uniform model. In C. Boyd, L. Simpson,
eds., Proc. of 18th Australasian Conf. on Information Security and
Privacy, ACISP 2013 (Brisbane, July 2013), v. 7959 of
Lect. Notes in Comput. Sci., pp. 152-167. Springer, 2013. doi:
10.1007/978-3-642-39059-3_11 (Scopus:
2-s2.0-84884494636)
- R. Chaabouni. Solving terminal revocation in EAC by
augmenting terminal authentication. In A. Brömme, C. Busch, eds.,
Proc. of 12th Int. Conf. of Biometrics Special Interest Group,
BIOSIG 2013 (Darmstadt, Sept. 2013), v. 212 of Lect. Notes
in Inform., pp. 273-280. Gesellschaft der Informatik, 2013. (Scopus: 2-s2.0-84887869574)
- S. H. Dau, V. Skachek, Y. M. Chee. Error correction for
index coding with side information. IEEE Trans. on
Inform. Theory, v. 59, n. 3, pp. 1517-1531, 2013. doi:
10.1109/tit.2012.2227674 (WOS:
000315120400019, Scopus: 2-s2.0-84873904555)
- F. Farnoud, V. Skachek, O. Milenkovic. Error-correction in
flash memories via codes in the Ulam metric. IEEE Trans. on
Inform. Theory, v. 59, n. 5, pp. 3003-3020, 2013. doi:
10.1109/tit.2013.2239700 (WOS:
000318163500026, Scopus: 2-s2.0-84876763334)
- P. Fauzi, H. Lipmaa, B. Zhang. Efficient modular NIZK
arguments from shift and product. In M. Abdalla, C. Nita-Rotaru,
R. Dahab, eds., Proc. of 12th Int. Conf. on Cryptology and Network
Security, CANS 2013 (Paraty, RJ, Nov. 2013), v. 8257 of
Lect. Notes in Comput. Sci., pp. 92-121 Springer, 2013. doi:
10.1007/978-3-319-02937-5_6 (Scopus:
2-s2.0-84892409743)
- M. Friesen, D. O. Theis. Fooling-sets and rank in nonzero
characteristic. In J. Nešetril, M. Pellegrini, eds.,
Proc. of 7th Europ. Conf. on Combinatorics, Graph Theory and
Applications, EuroComb 2013 (Pisa, Sept. 2013), v. 16 of
CRM Series, pp. 383-380. Scuola Normale Superiore, 2013. doi:
10.1007/978-88-7642-475-5_61
- M. González Muñiz, P. Laud. Strong forward security
in identity-based signcryption. J. of Discrete Mathematical
Sciences and Cryptography, v. 16, n. 4-5, pp. 235-258, 2013. doi:
10.1080/09720529.2013.821367 (Scopus:
84889669104)
- V. Gripon, V. Skachek, M. Rabbat. Sparse structured
associative memories as efficient set-membership data structures. In
Proc. of 51st Allerton Conf. on Communication, Control and
Computing (Allerton, IL, Oct. 2013), pp. 500-505. IEEE, 2013. doi:
10.1109/allerton.2013.6736566 (WOS:
000350802400070, Scopus: 2-s2.0-84897677387)
- S. Heiberg. New technologies for democratic elections. In
M. La Rosa, P. Soffer, eds., Revised Papers from BPM 2012
Int. Wkshs. (Tallinn, Sept. 2012), v. 132 of Lect. Notes in
Business Inform. Process., pp. 630-635. Springer, 2013. doi:
10.1007/978-3-642-36285-9_63 (Scopus:
2-s2.0-84873140709)
- D. Hofheinz, D. Unruh, J. Müller-Quade. Polynomial runtime
and composability. J. of Cryptol., v. 26, n. 3, pp. 375-441,
2013. doi:
10.1007/s00145-012-9127-4 (WOS:
000320001700001, Scopus: 2-s2.0-84878958915)
- L. Klingler, R. Steinwandt, D. Unruh. On using
probabilistic Turing machines to model participants in cryptographic
protocols. Theor. Comput. Sci., v. 501, pp. 49-51, 2013. doi:
10.1016/j.tcs.2013.05.015 (WOS:
000324151600006, Scopus: 2-s2.0-84882264264)
- P. Laud, A. Pankova. New attacks against
transformation-based privacy-preserving linear programming. In
R. Accorsi, S. Ranise, eds., Proc. of 9th Int. Wksh. on Security
and Trust Management, STM 2013 (Egham, Sept. 2013), v. 8203
of Lect. Notes in Comput. Sci., pp. 17-32. Springer, 2013. doi:
10.1007/978-3-642-41098-7_2 (WOS:
000340407200002, Scopus: 2-s2.0-84884724957)
- P. Laud, A. Pankova. On the (im)possibility of
privately outsourcing linear programming. In Proc. of 2013 ACM
Cloud Computing Security Workshop, CCSW '13 (Berlin,
Nov. 2013), pp. 55-64. ACM Press, 2013. doi:
10.1145/2517488.2517490 (Scopus:
2-s2.0-84889028611)
- P. Laud, A. Pankova, M. Pettai,
J. Randmets. Specifying Sharemind's arithmetic black box. In
Proc. of 1st ACM Wksh. on Language Support for Privacy Enhancing
Technologies, PETShop '13 (Berlin, Nov. 2013), pp. 19-21. ACM
Press, 2013. doi:
10.1145/2517872.2517874 (Scopus:
2-s2.0-84889068314)
- S. Laur, R. Talviste, J. Willemson. From
oblivious AES to efficient and secure database join in the multiparty
setting. In M. J. Jacobson Jr., M. E. Locasto, P. Mohassel,
R. Safavi-Naini, eds., Proc. of 11th Int. Conf. on Applied
Cryptography and Network Security, ACNS 2013 (Banff, AB, June
2013), v. 7954 of Lect. Notes in Comput. Sci.,
pp. 84-101. Springer, 2013. doi:
10.1007/978-3-642-38980-1_6 (Scopus:
2-s2.0-84879868386)
- A. N. Letchford, S. D. Nasiri, D. O. Theis. Compact
formulations of the Steiner traveling salesman problem and related
problems. Europ. J. of Oper. Res., v. 228, n. 1, pp. 83-92,
2013. doi:
10.1016/j.ejor.2013.01.044 (WOS:
000316582200008, Scopus: 2-s2.0-84875228397)
- H. Lipmaa. Succinct non-interactive zero knowledge
arguments from span programs and linear error-correcting codes. In
K. Sako, P. Sarkar, eds., Proc. of 19h Ann. Int. Conf. on the
Theory and Application of Cryptology and Information Security,
ASIACRYPT 2013 (Bangalore, Dec. 2013), Part I, v. 8269 of
Lect. Notes in Comput. Sci., pp. 41-60. Springer, 2013. doi:
10.1007/978-3-642-42033-7_3 (Scopus:
2-s2.0-84892418864)
- H. Lipmaa, T. Toft. Secure equality and greater-than tests
with sublinear online complexity. In F. Fomin, R. Freivalds,
M. Z. Kwiatkowska, D. Peleg, eds., Proc. of 40th Int. Coll. of
Automata, Languages and Programming, ICALP 2013 (Riga, July
2013), Part II, v. 7966 of Lect. Notes in Comput. Sci.,
pp. 645-656. Springer, 2013. doi:
10.1007/978-3-642-39212-2_56 (WOS:
000342684100056, Scopus: 2-s2.0-84880257665)
- H. Lipmaa, B. Zhang. A more efficient
computationally sound non-interactive zero-knowledge shuffle
argument. J. of Computer Security, v. 21, n. 5, pp. 685-719,
2013. doi:
10.3233/jcs-130478 (Scopus:
2-s2.0-84888875878)
- M. Pettai, P. Laud. Dynamics and secure information
flow for a higher-order pi-calculus. In H. Riis Nielson, D. Gollmann,
eds., Proc. of 18th Nordic Conf. on Secure IT Systems,
NordSec 2013 (Ilulissat, Oct. 2013), v. 8208 of
Lect. Notes in Comput. Sci., pp. 100-115. Springer, 2013. doi:
10.1007/978-3-642-41488-6_7 (WOS:
000340414300007, Scopus: 2-s2.0-84890890172)
- V. Skachek, O. Milenkovic, A. Nedic. Hybrid noncoherent
network coding. IEEE Trans. on Inform. Theory, v. 59, n. 6,
pp. 3317-3331, 2013. doi:
10.1109/tit.2013.2243899 (WOS:
000320709800006, Scopus: 2-s2.0-84877880723)
- E. Tyugu. Situation awareness and control errors of cyber
weapons. In Proc. of 2013 IEEE Int. Multi-Disciplinary Conf. on
Cognitive Methods in Situation Awareness and Decision Support,
CogSIMA '13 (San Diego, CA, Feb. 2013), pp. 143-148. IEEE,
2013. doi:
10.1109/cogsima.2013.6523838 (WOS:
000325568600023, Scopus: 2-s2.0-84879756121)
- D. Unruh. Everlasting multi-party computation. In
R. Canetti, J. A. Garay, eds., Proc. of 33rd Int. Cryptology Conf.,
CRYPTO 2013 (Santa Barbara, CA, Aug. 2013), Part II, v. 8043
of Lect. Notes in Comput. Sci., pp. 380-397. Springer, 2013. doi:
10.1007/978-3-642-40084-1_22 (Scopus:
2-s2.0-84884479550)
- Y. Xun, J. Willemson,
F. Naït-Abdesselam. Privacy-preserving wireless medical sensor
network. In Proc. of 12th IEEE Int. Conf. on Trust, Security and
Privacy in Computing and Communications, TrustCom 2013 / 11th
IEEE Int. Symp. on Parallel and Distributed Processing with
Applications, ISPA 2013 / 12th IEEE Int. Conf. on Ubiquitous
Computing and Communications, IUCC 2013 (Melbourne, July
2013), pp. 118-125. IEEE, 2013. doi:
10.1109/trustcom.2013.19 (WOS:
000332856700016, Scopus: 2-s2.0-84893452444)
- Y. Xun, M. Yuan, E. Bertino, J. Willemson. Multiparty
privacy protection for electronic health records. In Proc. of 2013
IEEE Global Communications Conf., GLOBECOM 2013 (Atlanta, GA,
Dec. 2013), pp. 2730-2735. IEEE, 2013. doi:
10.1109/glocom.2013.6831487 (Scopus:
2-s2.0-84904119074)
- B. Zhang, H. Lipmaa, C. Wang, K. Ren. Practical fully
simulatable oblivious transfer with sublinear communication. In
A.-R. Sadeghi, ed., Revised Selected Papers from 17th Int. Conf. on
Financial Cryptography, FC 2013 (Okinawa, Apr. 2013), v. 7859
of Lect. Notes in Comput. Sci., pp. 78-95. Springer, 2013. doi:
10.1007/978-3-642-39884-1_8 (Scopus:
2-s2.0-84883299076)
Publications 2014
- A. Ambainis, A. Rosmanis, D. Unruh. Quantum attacks on
classical proof systems - the hardness of quantum rewinding. In
Proc. of 55th Ann. IEEE Symp. on Foundations of Computer Science,
FOCS '14 (Philadelphia, PA, Oct. 2014), pp. 474-483. IEEE CS
Press, 2014. doi:
10.1109/focs.2014.57 (Scopus:
2-s2.0-84920055137)
- K. Ballerstein, D. O. Theis. An algorithm for random signed
3-SAT with intervals. Theor. Comput. Sci., v. 524, pp. 1-26,
2014. doi:
10.1016/j.tcs.2013.10.020 (WOS:
000332191500001, Scopus: 2-s2.0-84892876894)
- G. Barthe, M. Hicks, F. Kerschbaum, D. Unruh. Report from
Dagstuhl Seminar 14492 The Synergy Between Programming Languages and
Cryptography. Dagstuhl Reports, v. 4, n. 12, pp. 29-47, 2014.10.4230/dagrep.4.12.29
- D. Bogdanov, K. Emura, R. Jagomägis, A. Kanaoka,
S. Matsuo, J. Willemson. A secure genetic algorithm for the
subset cover problem and its application to privacy protection. In
D. Naccache, D. Sauveron, eds., Proc. of 8th IFIP WG 11.2
Int. Wksh. on Information Security Theory and Practice,
WISTP 2014: Securing Internet of Things (Heraklion, June/July
2014), v. 8501 of Lect. Notes in Comput. Sci.,
pp. 108-123. Springer, 2014. doi:
10.1007/978-3-662-43826-8_8 (WOS:
000345515600010, Scopus: 2-s2.0-84904128588)
- D. Bogdanov, L. Kamm, S. Laur, P.
Pruulmann-Vengerfeldt, R. Talviste, J. Willemson.
Privacy-preserving statistical data analysis on federated
databases. In B. Preneel, D. Ikonomou, eds., Proc. of 2nd Annnual
Privacy Forum, APF 2014 (Athens, May 2014), v. 8450 of
Lect. Notes in Comput. Sci., pp. 30-55. Springer, 2014. doi:
10.1007/978-3-319-06749-0_3 (Scopus:
2-s2.0-84901633789)
- D. Bogdanov, P. Laud, S. Laur,
P. Pullonen. From input private to universally composable
secure multiparty computation primitives. In Proc. of 27th IEEE
Computer Security Foundations Symp., CSF 2014 (Vienna, July
2014), pp. 184-198. IEEE, 2014. doi:
10.1109/csf.2014.21 (Scopus:
2-s2.0-84939630780)
- D. Bogdanov, P. Laud, J. Randmets.
Domain-polymorphic programming of privacy-preserving applications. In
Proc. 9th ACM Wksh. on Programming Languages and Analysis for
Security, PLAS 2014 (Uppsala, July 2014), pp. 53-65. ACM
Press, 2014. doi:
10.1145/2637113.2637119 (Scopus:
2-s2.0-84907419000)
- D. Bogdanov, S. Laur, R. Talviste. A practical
analysis of oblivious sorting algorithms for secure multi-party
computation. In K. Bernsmed, S. Fischer-Hübner, eds., Proc. of 19th
Nordic Conf. on Secure IT Systems, NordSec 2014 (Tromsø,
Oct. 2014), v. 8788 of Lect. Notes in Comput. Sci.,
pp. 59-74. Springer, 2014. doi:
10.1007/978-3-319-11599-3_4 (Scopus:
2-s2.0-84910059759)
- D. Bogdanov, P. Pruulmann-Vengerfeldt. Adoption barriers of
secure computation for decision making in a defence application. In
Proc. of STO System Analysis and Studies Panel Symp. on Analysis
Support to Decision Making in Cyber Defence and Security, SAS 106
(Tallinn, June 2014). NATO STO, 2014.
- A. Buldas, R. Laanoja, A. Truu,
P. Laud. Bounded pre-image awareness and the security of
hash-tree keyless signatures. In S. S. M. Chow, J. K. Liu,
L. C. K. Hui, S. M. Yiu, eds., Proc. of 8th Int. Conf. on Provable
Security, ProvSec 2014 (Hong Kong, Oct. 2014), v. 8782 of
Lect. Notes in Comput. Sci., pp. 130-145. Springer, 2014. doi:
10.1007/978-3-319-12475-9_10 (WOS: 000345592800010, Scopus:
2-s2.0-84909996429)
- A. Buldas, A. Truu, R. Laanoja,
R. Gerhards. Efficient record-level keyless signatures for logs. In
K. Bernsmed, S. Fischer-Hübner, eds., Proc. of 19th Nordic Conf. on
Secure IT Systems, NordSec 2014 (Tromsø, Oct. 2014), v. 8788
of Lect. Notes in Comput. Sci., pp. 149-164. Springer, 2014. doi:
10.1007/978-3-319-11599-3_9 (Scopus:
2-s2.0-84910065175)
- N. Clarke, S. Fiorini, G. Joret, D. O. Theis. A note on the
cops and robber game on graphs embedded in non-orientable
surfaces. Graphs and Comb., v. 30, n. 1, pp. 119-124, 2014. doi:
10.1007/s00373-012-1246-z (WOS:
000328625000007, Scopus: 2-s2.0-84890571995)
- S. H. Dau, V. Skachek, Y. M. Chee. Optimal index codes with
near-extreme rates. IEEE Trans. on Inform. Theory, v. 60, n. 3,
pp. 1515-1527, 2014. doi:
10.1109/tit.2013.2295331 (WOS:
000331902400011, Scopus: 2-s2.0-84896834726)
- P. Fauzi, H. Lipmaa, B. Zhang. Efficient
non-interactive zero knowledge arguments for set operations. In
N. Christin, R. Safavi-Naini, eds., Revised Selected Papers from
18th Int. Conf. on Financial Cryptography, FC 2014 (Barbados,
March 2014), v. 8437 of Lect. Notes in Comput. Sci.,
pp. 216-233. Springer, 2014. doi:
10.1007/978-3-662-45472-5_14 (WOS:
000354953200014, Scopus: 2-s2.0-84916620733)
- V. Gripon, V. Skachek, M. Rabbat. Sparse binary matrices as
efficient associative memories. In Proc. of 52nd Allerton Conf. on
Communication, Control, and Computing (Allerton, IL,
Sept./Oct. 2014), pp. 499-504. IEEE, 2014. doi:
10.1109/allerton.2014.7028496 (Scopus:
2-s2.0-84923863339)
- R. Guanciale, D. Gurov, P. Laud. Private intersection of
regular languages. In Proc. of 12th Ann. Conf. on Privacy,
Security and Trust, PST 2014 (Toronto, ON, July 2014),
pp. 112-120. IEEE, 2014. doi:
10.1109/pst.2014.6890930 (Scopus:
2-s2.0-84910093642)
- S. Heiberg, J. Willemson. Modeling threats of a
voting method. In D. Zissis, D. Lekkas, eds., Design, Development,
and Use of Secure Electronic Voting Systems, pp. 128-148. IGI
Global, 2014. doi:
10.4018/978-1-4666-5820-2.ch007 (Scopus:
2-s2.0-84922503404)
- S. Heiberg, J. Willemson. Verifiable internet voting
in Estonia. In R. Krimmer, M. Volkamer, Proc. of 6th Int. Conf. on
Electronic Voting, EVOTE 2014 (Lochau/Bregenz, Oct. 2014),
pp. 23-29. Tallinn Univ. of Techn./IEEE, 2014. volume in TUT DL, doi:
10.1109/evote.2014.7001135 (Scopus:
2-s2.0-84922551870)
- T. Krips, J. Willemson. Hybrid model of fixed and
floating point numbers in secure multiparty computations. In
S. S. M. Chow, J. Camenisch, L. C. K. Hui, S.-M. Yiu, eds.,
Proc. of 17th Int. Conf. on Information Security, ISC 2014
(Hong Kong, Oct. 2014), v. 8783 of Lect. Notes in
Comput. Sci., pp. 179-197. Springer, 2014. doi:
10.1007/978-3-319-13257-0_11 (Scopus:
2-s2.0-84921490562)
- P. Laud, A. Pankova. Verifiable computation in
multiparty protocols with honest majority. In S. S. M. Chow,
J. K. Liu, L. C. K. Hui, S. M. Yiu, eds., Proc. of 8th
Int. Conf. on Provable Security, ProvSec 2014 (Hong Kong,
Oct. 2014), v. 8782 of Lect. Notes in Comput. Sci.,
pp. 146-161. Springer, 2014. doi:
10.1007/978-3-319-12475-9_11 (WOS: 000345592800011, Scopus:
2-s2.0-84909998998)
- S. Laur, B. Zhang. Lightweight zero-knowledge proofs for
crypto-computing protocols. In
S. S. M. Chow, J. Camenisch, L. C. K. Hui, S.-M. Yiu, eds.,
Proc. of 17th Int. Conf. on Information Security, ISC 2014
(Hong Kong, Oct. 2014), v. 8783 of Lect. Notes in
Comput. Sci., pp. 140-157. Springer, 2014. doi:
10.1007/978-3-319-13257-0_9 (Scopus:
2-s2.0-84921342618)
- A. Lenin, A. Buldas. Limiting adversarial budget in
quantitative security assessment. In R. Poovendran, W. Saad, eds.,
Proc. of 5th Int. Conf. on Decision and Game Theory for Security,
GameSec 2014 (Los Angeles, CA, Nov. 2014), v. 8840 of
Lect. Notes in Comput. Sci., pp. 155-174. Springer, 2014. doi:
10.1007/978-3-319-12601-2_9 (WOS:
000345594300009, Scopus: 2-s2.0-84910020028)
- A. Lenin, J. Willemson, D. P. Sari. Attacker
profiling in quantitative security assessment based on attack
trees. In K. Bernsmed, S. Fischer-Hübner, eds., Proc. of 19th
Nordic Conf. on Secure IT Systems, NordSec 2014 (Tromsø,
Oct. 2014), v. 8788 of Lect. Notes in Comput. Sci.,
pp. 199-212. Springer, 2014. doi:
10.1007/978-3-319-11599-3_12 (Scopus:
2-s2.0-84910045330)
- H. Lipmaa. Efficient NIZK arguments via parallel
verification of Benes networks. In M. Abdalla, R. De Prisco, eds.,
Proc. of 9th Conf. on Security and Cryptography for Networks,
SCN 2014 (Amalfi, Sept. 2014), v. 8642 of
Lect. Notes in Comput. Sci., pp. 416-434. Springer, 2014. doi:
10.1007/978-3-319-10879-7_24 (Scopus:
2-s2.0-84927657181)
- A. Ojamaa, U.-R. Lind. Securing customer email
communication in e-commerce. In Proc. of 6th Int. Conf. on
Developments in e-Systems Engineering, DeSE '13 (Abu Dhabi,
Dec. 2013), pp. 291-296. IEEE, 2014. (Paper delivered at 5th
DeSE '12, Bucharest,
Sept. 2012.) doi:
10.1109/dese.2013.59 (WOS:
000380467500050, Scopus: 2-s2.0-84924363029)
- A. Paršovs. Practical issues with TLS client
certificate authentication. In Proc. of 2014 Network and
Distributed System Security Symp., NDSS '14 (San Diego, CA,
Feb. 2014), 13 pp. Internet Society,
2014. doi:
10.14722/ndss.2014.23036
- V. Skachek, K. A. S. Immink. Constant weight codes: an
approach based on Knuth's balancing method. IEEE J. on Selected
Areas in Communications, v. 32, n. 5, pp. 909-918, 2014. doi:
10.1109/jsac.2014.140511 (WOS:
000335385100011, Scopus: 2-s2.0-84899883087)
- V. Skachek, M. Rabbat. Subspace synchronization: a
network-coding approach to object reconciliation. In Proc. of 2014
IEEE Int. Symp. on Information Theory, ISIT 2014 (Honolulu, HI,
June/July 2014), pp. 2301-2305. IEEE, 2014. doi:
10.1109/isit.2014.6875244 (WOS:
000346496102088, Scopus: 2-s2.0-84906536018)
- D. O. Theis. On the facial structure of symmetric and
graphical traveling salesman polyhedra. Discr. Optim., v. 12,
pp. 10-25, 2014. doi:
10.1016/j.disopt.2013.12.003
(WOS: 000335635700002, Scopus:
2-s2.0-84892733756)
- D. Unruh. Quantum position verification in the random
oracle model. In J. A. Garay, R. Gennaro, eds., Proc. of 34th
Int. Cryptology Conf., CRYPTO 2014 (Santa Barbara, CA,
Aug. 2014), Part II, v. 8617 of
Lect. Notes in Comput. Sci., pp. 1-18. Springer, 2014. doi:
10.1007/978-3-662-44381-1_1 (Scopus:
2-s2.0-84905398331)
- D. Unruh. Revocable quantum timed-release encryption. In
P. Q. Nguyen, E. Oswald, eds., Proc. of 33rd Ann. Int. Conf. on the
Theory and Applications of Cryptographic Techniques,
EUROCRYPT 2014 (Copenhagen, May 2014), v. 8441 of
Lect. Notes in Comput. Sci., pp. 129-146. Springer, 2014. doi:
10.1007/978-3-642-55220-5_8 (WOS:
000352691200008, Scopus: 2-s2.0-84901659814)
Publications 2015
- D. Bogdanov, M. Jõemets, M. Vaht, S. Siim. How the
Estonian Tax and Customs Board evaluated a tax fraud detection system
based on secure multi-party computation. In R. Böhme, T. Okamoto,
eds., Revised Selected Papers from 19th Int. Conf. on Financial
Cryptography and Data Security, FC 2015 (San Juan,
Jan. 2015), v. 8975 of Lect. Notes in Comput. Sci.,
pp. 227-234. Springer, 2015. doi:
10.1007/978-3-662-47854-7_14 (Scopus:
2-s2.0-84949987236)
- F. Böhl, D. Unruh. Symbolic universal
composability. J. of Comput. Security, v. 24, n. 1, pp. 1-38,
2016. doi:
10.3233/jcs-140523 (Scopus:
2-s2.0-84960438768)
- B. Chen, D. N. K. Jayakody, M. F. Flanagan. Distributed
low-density lattice codes. IEEE Commun. Lett., v. 20, n. 1,
2016. doi:
10.1109/lcomm.2015.2497679 (Scopus:
2-s2.0-84959318458)
- B. Chen, D. N. K. Jayakody, M. F. Flanagan. Low-density
lattice coded relaying with joint iterative decoding. IEEE
Trans. on Commun., v. 63, n. 12, pp. 4824-4837, 2015. doi:
10.1109/tcomm.2015.2493551 (Scopus:
2-s2.0-84961828031)
- M. Friesen, A. Hamed, T. Lee, D. O. Theis. Fooling-sets and
rank. Eur. J. of Comb., v. 48, pp. 143-153, 2015. doi:
10.1016/j.ejc.2015.02.016 (WOS:
000355041300014, Scopus: 2-s2.0-84924873457)
- F. Göloglu, J. Lember, A.-E. Riet,
V. Skachek. New bounds for permutation codes in Ulam metric. In
Proc. of 2015 IEEE Int. Symp. on Information Theory, ISIT 2015
(Hong Kong, June 2015), pp. 1726-1730. IEEE, 2015. doi:
10.1109/isit.2015.7282751 (Scopus:
2-s2.0-84969857991)
- R. Guanciale, D. Gurov, P. Laud. Business process
engineering and secure multiparty computation. In P. Laud, L. Kamm,
eds.,
Applications of Secure Multiparty Computation, v. 13 of
Cryptology and Information Security Series, pp. 129-149. IOS
Press, 2015. doi:
10.3233/978-1-61499-532-6-129 (Scopus:
2-s2.0-84938075139)
- D. Gurov, P. Laud, R. Guanciale. Privacy preserving
business process matching. In Proc. of 13th Ann. Conf. on Privacy,
Security and Trust (Izmir, July 2015), pp. 36-43. IEEE, 2015. doi:
10.1109/pst.2015.7232952 (Scopus:
2-s2.0-84958659600)
- S. Heiberg, A. Paršovs, J. Willemson. Log
analysis of Estonian internet voting 2013-2014. In R. Haenni,
R. E. Koenig, D. Wikström, eds., Proc. of 5th Int. Conf. on
E-voting and Identity, VoteID '15 (Bern, Sept. 2015), v. 9269
of Lect. Notes in Comput. Sci., pp. 19-34. Springer,
2015. doi:
10.1007/978-3-319-22270-7_2 (Scopus:
2-s2.0-84944675048)
- D. N. K. Jayakody, J. Li. Optimum power allocation for LDPC
coded soft forwarding scheme in wireless networks. In Proc. of 81st
IEEE Vehicular Technology Conf., VTC Spring 2015 (Glasgow, May
2015), 6 pp. IEEE, 2015. doi:
10.1109/vtcspring.2015.7145988 (Scopus:
2-s2.0-84940398808)
- D. N. K. Jayakody, V. Skachek, B. Chen.
Spatially-coupled LDPC coding in cooperative wireless
networks. Eurasip J. on Advances in Signal Processing, v. 2016,
article 20, 2016. doi:
10.1186/s13634-016-0311-9 (Scopus:
2-s2.0-84958778990)
- L. Kamm, D. Bogdanov, A. Pankova,
R. Talviste. Statistical analysis methods using secure
multiparty computation. In P. Laud, L. Kamm, eds.,
Applications of Secure Multiparty Computation, v. 13 of
Cryptology and Information Security Series, pp. 58-80. IOS
Press, 2015. doi:
10.3233/978-1-61499-532-6-58 (Scopus:
2-s2.0-84938072370)
- L. Kamm, J. Willemson. Secure floating point
arithmetic and private satellite collision analysis. Int. J. of
Inform. Security, v. 14, n. 6, pp. 531-548, 2015. doi:
10.1007/s10207-014-0271-8 (Scopus:
2-s2.0-84918551434)
- K. Khoshkhah. On finding orientations with fewest number of
vertices with small out-degree. Discr. Appl. Math., v. 194,
pp. 163-166, 2015. doi:
10.1016/j.dam.2015.05.007 (Scopus:
2-s2.0-84940720507)
- A. Kiayias, N. Leonardos, H. Lipmaa, K. Pavlyk,
Q. Tang. Communication optimal Tardos-based asymmetric
fingerprinting. In K. Nyberg, ed., Proc. of RSA
Conf. Crytographers' Track, CT-RSA 2015 (San Fransciso, CA,
Apr. 2015), v. 9048 of Lect. Notes in Comput. Sci.,
pp. 469-486. Springer, 2015. doi:
10.1007/978-3-319-16715-2_25 (Scopus:
2-s2.0-84930427033)
- A. Kiayias, N. Leonardos, H. Lipmaa, K. Pavlyk,
Q. Tang. Optimal rate private information retrieval from homomorphic
encryption. Proc. on Privacy Enhancing Technologies, v. 2015,
n. 2, pp. 222-243, 2015. doi:
10.1515/popets-2015-0016
- H. Klauck, T. Lee, D. O. Theis, R. R. Thomas. Report from
Dagstuhl Seminar 15082 Limitations of Convex Programming: Lower Bounds
on Extended Formulations and Factorization Ranks. Dagstuhl
Reports, v. 5, n. 2, pp. 109-127, 2015.10.4230/dagrep.5.2.109
- T. Krips, J. Willemson. Point-counting method for
embarrassingly parallel evaluation in secure computation. In
J. Garcia-Alfaro, E. Kranakis, G. Bonfante, eds.,
Revised Selected Papers from 8th Int. Symp. on Foundations and
Practice of Security, FPS 2015 (Clermont-Ferrand, Oct. 2015),
v. 9482 of Lect. Notes in Comput. Sci., pp. 66-82. Springer,
2016. doi:
10.1007/978-3-319-30303-1_5 (Scopus:
2-s2.0-84960356285)
- I. Kubjas, V. Skachek. Data dissemination problem in
wireless networks. In Proc. of 53rd Ann. Allerton Conf. on
Communication, Control, and Computing (Allerton, IL,
Sept./Oct. 2015), pp. 1197-1204. IEEE, 2015. doi:
10.1109/allerton.2015.7447144 (Scopus:
2-s2.0-84969776958)
- P. Laud. A private lookup protocol with low online
complexity for secure multiparty computation. In L. C. K. Hui,
S. H. Qing, E. Shi, S. M. Yiu, eds., Revised Selected Papers from
16th Int. Conf. on Information and Communications Security,
ICICS 2014 (Hong Kong, Dec. 2014), v. 8958 of
Lect. Notes in Comput. Sci., pp. 143-157. Springer, 2015. doi:
10.1007/978-3-319-21966-0_11 (Scopus:
2-s2.0-84943636040)
- P. Laud. Oblivious array access for secure multiparty
computation. In P. Laud, L. Kamm, eds.,
Applications of Secure Multiparty Computation, v. 13 of
Cryptology and Information Security Series, pp. 106-128. IOS
Press, 2015. doi:
10.3233/978-1-61499-532-6-106 (Scopus:
2-s2.0-84938087934)
- P. Laud. Parallel oblivious array access for secure
multiparty computation and privacy-preserving minimum spanning
trees. Proc. on Privacy Enhancing Technologies, v. 2015, n. 2,
pp. 188-205, 2015. doi:
10.1515/popets-2015-0011
- P. Laud. Stateful abstractions of secure multiparty
computation. In P. Laud, L. Kamm, eds.,
Applications of Secure Multiparty Computation, v. 13 of
Cryptology and Information Security Series, pp. 26-42. IOS
Press, 2015. doi:
10.3233/978-1-61499-532-6-26 (Scopus:
2-s2.0-84938078810)
- P. Laud, L. Kamm, eds. Applications of Secure
Multiparty Computation, v. 13 of Cryptology and Information
Security Series, ix+253 pp. IOS Press, 2015. volume
in IOS Press BooksOnline (Scopus:
2-s2.0-84938118108)
- P. Laud, A. Pankova, L. Kamm,
M. Veeningen. Basic constructions of secure multiparty computation.
In P. Laud, L. Kamm, eds.,
Applications of Secure Multiparty Computation, v. 13 of
Cryptology and Information Security Series, pp. 1-25. IOS
Press, 2015. doi:
10.3233/978-1-61499-532-6-1 (Scopus:
2-s2.0-84938072868)
- P. Laud, J. Randmets. A domain-specific language for
low-level secure multiparty computation protocols. In Proc. of 22nd
ACM Conf. on Computer and Communications Security, ACM CCS '15
(Denver, CO, Oct. 2015), pp. 1492-1503. ACM Press, 2015. doi:
10.1145/2810103.2813664 (Scopus:
2-s2.0-84954132841)
- P. Laud, J. Willemson. Composable oblivious extended
permutations. In F. Cuppens, J. Garcia-Alfaro, N. Z. Heywood,
P. W. L. Fong, eds., Revised Selected Papers from 7th Int. Symp. on
Foundations and Practice of Security, FPS 2014 (Montreal,
Nov. 2014), v. 8930 of Lect. Notes in Comput. Sci.,
pp. 294-310. Springer, 2015. doi:
10.1007/978-3-319-17040-4_19 (Scopus:
2-s2.0-84928562758)
- J. D. Lee, A.-E. Riet. F-saturation
games. Discr. Math., v. 338, n. 12, pp. 2356-2362, 2015. doi:
10.1016/j.disc.2015.05.028 (Scopus:
2-s2.0-84934973567)
- A. Lenin, J. Willemson,
A. Charnamord. Genetic approximations for the failure-free
security games. In M. H. R. Khouzani, E. Panaousis,
G. Theodorakopoulos, eds., Proc. of 6th Int. Conf. on Decision and
Game Theory for Security, GameSec 2015 (London, Nov. 2015),
v. 9406 of Lect. Notes in Comput. Sci., pp. 311-321. Springer,
2015. doi:
10.1007/978-3-319-25594-1_17 (Scopus:
2-s2.0-84953301083)
- H. Lipmaa, K. Pavlyk. Analysis and implementation of an
efficient ring-LPN based commitment scheme. In M. Reiter, D. Naccache,
eds., Proc. of 14th Int. Conf. on Cryptology and Network Security,
CANS 2015 (Marrakech, Dec. 2015), v. 9476 of
Lect. Notes in Comput. Sci., pp. 160-175. Springer, 2015. doi:
10.1007/978-3-319-26823-1_12 (Scopus:
2-s2.0-84952684661)
- H. Lipmaa, V. Skachek. Linear batch codes. In
R. Pinto, P. Rocha Malonek, P. Vettori, eds., Proc. of 4th
Int. Castle Meeting on Coding Theory and Applications, ICMCTA 2014
(Palmela, Sept. 2014), v. 3 of CIM Series in Mathematical
Sciences, pp. 245-253. Springer, 2015. doi:
10.1007/978-3-319-17296-5_26
- D. K. Nguyen, D. N. K. Jayakody, H. Ochi. Soft information
relaying scheme with transceiver hardware impairments in cognitive
networks. In Proc. of 10th Int. Conf. on Information,
Communications and Signal Processing, ICICS '15 (Singapore,
Dec. 2015), 5 pp. IEEE, 2015. doi:
10.1109/icics.2015.7459913 (Scopus:
2-s2.0-84973667669)
- A. Ojamaa, E. Tyugu. Enterprise security analysis
and training experience. In C. G. Panayiotou, G. Ellinas,
E. Kyriakides, M. M. Polycarpou, eds., Revised Selected Papers from
9th Int. Conf. on Critical Information Infrastructures Security,
CRITIS 2014 (Limassol, Oct. 2014), v. 8985 of Lect. Notes
in Comput. Sci., pp. 200-208. Springer, 2016. doi:
10.1007/978-3-319-31664-2_21 (Scopus:
2-s2.0-84962339704)
- A. Pankova, P. Laud. Transformation-based
computation and impossibility results. In P. Laud, L. Kamm, eds.,
Applications of Secure Multiparty Computation, v. 13 of
Cryptology and Information Security Series, pp. 216-245. IOS
Press, 2015. doi:
10.3233/978-1-61499-532-6-216 (Scopus:
2-s2.0-84938056763)
- A. Pankova, P. Laud. Verifiable computation in
multiparty protocols with honest majority. In P. Laud, L. Kamm, eds.,
Applications of Secure Multiparty Computation, v. 13 of
Cryptology and Information Security Series, pp. 165-185. IOS
Press, 2015. doi:
10.3233/978-1-61499-532-6-165 (Scopus:
2-s2.0-84938074644)
- M. Pettai, P. Laud. Automatic proofs of privacy of
secure multi-party computation protocols against active adversaries.
In Proc. of 28th IEEE Computer Security Foundations Symposium,
CSF '15 (Verona, July 2015), pp. 75-89. IEEE, 2015. doi:
10.1109/csf.2015.13 (WOS:
000380428500006, Scopus: 2-s2.0-84956568030)
- M. Pettai, P. Laud. Combining differential privacy
and secure multiparty computation. In Proc. of 31st Ann. Computer
Security Appl. Conf., ACSAC '15 (Los Angeles, CA, Dec. 2015),
ACM Int. Conf. Proc. Series, pp. 421-430. ACM Press, 2015. doi:
10.1145/2818000.2818027 (Scopus:
2-s2.0-84959346785)
- P. Pullonen, S. Siim. Combining secret sharing and
garbled circuits for efficient private IEEE 754 floating-point
computations. In M. Benner, N. Christin, B. Johnson, K. Rohloff, eds.,
Revised Selected Papers from FC 2015 Int. Wkshs. (San Juan,
Jan. 2015), v. 8976 of Lect. Notes in Comput. Sci.,
pp. 172-183. Springer, 2015. doi:
10.1007/978-3-662-48051-9_13 (Scopus:
2-s2.0-84950290695)
- A.-E. Riet, J. D. Lee. Graph saturation games. In
M. Campêlo, R. Corrrêa, C. Linhares-Sales, R. Sampaio, eds.,
Proc. of 8th Latin-American Algorithms, Graphs and Optimization
Symp., LAGOS 2015 (Fortaleza, May 2015), v. 50 of
Electron. Notes in Discr. Math., pp. 349-354. Elsevier,
2015. doi:
10.1016/j.endm.2015.07.058 (Scopus:
2-s2.0-84953390009)
- D. Unruh. Non-interactive zero-knowledge proofs in the
quantum random oracle model. In E. Oswald, M. Fischlin, eds.,
Proc. of 34th Ann. Int. Conf. on the Theory and Applications of
Cryptographic Techniques, EUROCRYPT 2015 (Sofia, Apr. 2015), Part
II, v. 9057 of Lect. Notes in Comput. Sci.,
pp. 755-784. Springer, 2015. doi:
10.1007/978-3-662-46803-6_25 (Scopus:
2-s2.0-84942673198)
- D. Unruh. Revocable quantum timed-release encryption.
J. of ACM, v. 62, n. 6, article 49, 2015. doi: 10.1145/2817206
(Scopus: 2-s2.0-84950296400)
- Y. Yakimenka, V. Skachek. Refined upper bounds on
stopping redundancy of binary linear codes. In Proc. of 2015 IEEE
Information Theory Wksh., ITW 2015 (Jerusalem, May 2015), 5
pp. IEEE, 2015. doi:
10.1109/itw.2015.7133087 (Scopus:
2-s2.0-84938904790)
- X. Yi, A. Bouguettaya, D. Georgakopoulos, A. Song, J.
Willemson. Privacy protection for wireless medical sensor
data. IEEE Trans. on Dependable and Secure Computing, v. 13,
n. 3, pp. 369-380, 2016. doi:
10.1109/tdsc.2015.2406699 (Scopus:
2-s2.0-84970006994)
PhD defenses 2008
- S. Laur. Cryptographic Protocol Design, v. TKK-ICS-D2 of
TKK Diss. in Inform. and Comput. Sci., xi+131 pp. +
publs. Helsinki Univ. of Techn., 2008. thesis at
HUT
Defense at Helsinki Univ. of Techn., 25 Apr. 2008. Supervisor
K. Nyberg (Helsinki Univ. of Techn.), opponent S. Vaudenay (EPF
Lausanne).
- I. Tšahhirov. Security Protocols Analysis in the
Computational Model - Dependency Flow Graphs-Based Approach,
Thesis on Informatics and System Engineering C44, 204
pp. Tallinn Univ. of Techn., 2008. thesis in TUT DL
Defense at Tallinn Univ. of Techn., 15 Dec. 2008. Supervisor
J. Tepandi (TUT), consultant P. Laud (Cybernetica AS). Opponents
C. Fournet (Microsoft Research, Cambridge), V. Vene (Univ. of
Tartu).
PhD defenses 2010
- A. Jürgenson. Efficient Semantics of Parallel and Serial Models
of Attack Trees, Thesis on Informatics and System
Engineering C54, 158 pp. Tallinn Univ. of Techn., 2010. thesis in TUT DL
Defense at Tallinn Univ. of Techn., 21 June 2010. Supervisors
A. Buldas (Tallinn Univ. of Techn.), J. Willemson (Cybernetica
AS). Opponents S. Mauw (Univ. of Luxembourg), T. Tammet (Tallinn
Univ. of Techn.).
PhD defenses 2011
- M. Niitsoo. Black-box Oracle Separation Techniques with
Applications in Time-Stamping, v. 67 of
Diss. Math. Univ. Tartuensis, 174 pp. Univ. of Tartu,
2011. handle:
10062/17024
Defense at Univ. of Tartu, 20 May 2011. Supervisor A. Buldas (Tallinn
Univ. of Techn.). Opponents B. Schoenmakers (Eindhoven Univ. of
Technology), H. Lipmaa (Tallinn Univ.).
- B. Zhang. Efficient Cryptographic Protocols for Secure
and Private Remote Databases, v. 77 of
Diss. Math. Univ. Tartuensis, 206 pp. Univ. of Tartu,
2011. handle:
10062/18481
Defense at Univ. of Tartu, 10 October 2011. Supervisors H. Lipmaa,
P. Laud (Univ. of Tartu). Opponents J. Groth (Univ. College London),
J. B. Nielsen (Univ. of Aarhus).
PhD defenses 2013
- D. Bogdanov. Sharemind: Programmable Secure Computations
with Practical Applications, v. 83 of
Diss. Math. Univ. Tartuensis, 191 pp. Univ. of Tartu,
2013. handle:
10062/29041
Defense at Univ. of Tartu, 28 Feb. 2013. Supervisor S. Laur (Univ. of
Tartu). Opponents N. P. Smart (Univ. of Bristol), B. Schoenmakers
(Eindhoven Univ. of Techn.).
PhD defenses 2015
- L. Kamm. Privacy-Preserving Statistical Analysis Using
Secure Multi-Party Computation, v. 94 of
Diss. Math. Univ. Tartuensis, 201 pp. Univ. of Tartu,
2015. handle:
10062/45343
Defense at Univ. of Tartu, 9 March 2015. Supervisor S. Laur (Univ. of
Tartu). Opponents R. N. Wright (Rutgers Univ.), G. Danezis
(Univ. College London).
Last update 29 August 2016