default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDToomas Krips
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Conference and Workshop Papers
- 2024
[c7]Behzad Abdolmaleki
, Prastudy Fauzi, Toomas Krips, Janno Siim:
Shuffle Arguments Based on Subset-Checking. SCN (1) 2024: 345-366- 2023
- [c6]Pascal Reisert, Marc Rivinius, Toomas Krips, Ralf Küsters:
Overdrive LowGear 2.0: Reduced-Bandwidth MPC without Sacrifice. AsiaCCS 2023: 372-386 - 2022
- [c5]Nicolas Huber, Ralf Küsters, Toomas Krips, Julian Liedtke, Johannes Müller, Daniel Rausch, Pascal Reisert, Andreas Vogt:
Kryvos: Publicly Tally-Hiding Verifiable E-Voting. CCS 2022: 1443-1457 - 2021
- [c4]Toomas Krips, Helger Lipmaa:
More Efficient Shuffle Argument from Unique Factorization. CT-RSA 2021: 252-275 - 2016
- [c3]Vassil S. Dimitrov, Liisi Kerik, Toomas Krips, Jaak Randmets, Jan Willemson:
Alternative Implementations of Secure Real Numbers. CCS 2016: 553-564 - 2015
- [c2]Toomas Krips, Jan Willemson:
Point-Counting Method for Embarrassingly Parallel Evaluation in Secure Computation. FPS 2015: 66-82 - 2014
- [c1]Toomas Krips, Jan Willemson:
Hybrid Model of Fixed and Floating Point Numbers in Secure Multiparty Computations. ISC 2014: 179-197
Informal and Other Publications
- 2024
- [i9]Behzad Abdolmaleki, Prastudy Fauzi, Toomas Krips, Janno Siim:
Shuffle Arguments Based on Subset-Checking. IACR Cryptol. ePrint Arch. 2024: 1056 (2024) - [i8]Erki Külaots, Toomas Krips, Hendrik Eerikson, Pille Pullonen-Raudvere:
SLAMP-FSS: Two-Party Multi-Point Function Secret Sharing from Simple Linear Algebra. IACR Cryptol. ePrint Arch. 2024: 1394 (2024) - [i7]Pascal Reisert, Marc Rivinius, Toomas Krips, Sebastian Hasler, Ralf Küsters:
Actively Secure Polynomial Evaluation from Shared Polynomial Encodings. IACR Cryptol. ePrint Arch. 2024: 1435 (2024) - 2023
- [i6]Sebastian Hasler, Toomas Krips, Ralf Küsters, Pascal Reisert, Marc Rivinius:
Overdrive LowGear 2.0: Reduced-Bandwidth MPC without Sacrifice. IACR Cryptol. ePrint Arch. 2023: 462 (2023) - 2022
- [i5]Pascal Reisert, Marc Rivinius, Toomas Krips, Ralf Küsters:
Arithmetic Tuples for MPC. IACR Cryptol. ePrint Arch. 2022: 667 (2022) - [i4]Nicolas Huber, Ralf Küsters, Toomas Krips, Julian Liedtke, Johannes Müller, Daniel Rausch, Pascal Reisert, Andreas Vogt:
Kryvos: Publicly Tally-Hiding Verifiable E-Voting. IACR Cryptol. ePrint Arch. 2022: 1132 (2022) - 2021
- [i3]Toomas Krips, Helger Lipmaa:
More Efficient Shuffle Argument from Unique Factorization. IACR Cryptol. ePrint Arch. 2021: 438 (2021) - 2016
- [i2]Vassil S. Dimitrov, Liisi Kerik, Toomas Krips, Jaak Randmets, Jan Willemson:
Alternative Implementations of Secure Real Numbers. IACR Cryptol. ePrint Arch. 2016: 773 (2016) - 2014
- [i1]Toomas Krips, Jan Willemson:
Hybrid Model of Fixed and Floating Point Numbers in Secure Multiparty Computations. IACR Cryptol. ePrint Arch. 2014: 221 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 02:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
